default search action
Kam-Hoi Cheng
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
- [c22]Nathan Leach, Kam-Hoi Cheng:
Recognizing and understanding time-terms in communication. SMC 2011: 3023-3028 - 2010
- [c21]Waleed Fekry Faris, Kam-Hoi Cheng:
Understanding Pronouns. IC-AI 2010: 850-856
2000 – 2009
- 2009
- [j18]Kam-Hoi Cheng, Waleed Fekry Faris:
A multi-dimensional data organization for natural language processing. J. Comput. Methods Sci. Eng. 9(4-6): 81-90 (2009) - [c20]Eunjeong Ahn, Waleed Fekry Faris, Kam-Hoi Cheng:
Recognizing the Effects Caused by an Action in a Declarative Sentence. IC-AI 2009: 149-155 - 2008
- [c19]Waleed Fekry Faris, Kam-Hoi Cheng:
An Object-Oriented Approach in Representing the English Grammar and Parsing. IC-AI 2008: 325-331 - [c18]Waleed Fekry Faris, Kam-Hoi Cheng:
A Multi-Dimensional Data Organization for Natural Language Processing. SEDE 2008: 115-119 - 2007
- [c17]Kam-Hoi Cheng:
Representing Definitions And Its Associated Knowledge In A Learning Program. IC-AI 2007: 71-77 - 2006
- [c16]Kam-Hoi Cheng:
The representation and inferences of hierarchies. ACST 2006: 269-273 - 2000
- [j17]Shaobin Liu, Kam-Hoi Cheng, Xiaoping Liu:
Network reliability with node failures. Networks 35(2): 109-117 (2000)
1990 – 1999
- 1997
- [c15]P. R. Venkata Subramaniam, Kam-Hoi Cheng:
A Reconfigurable Mesh Design For a Simultaneous Access Match-and-Store Unit. PDPTA 1997: 555- - 1994
- [c14]P. R. Venkata Subramaniam, Kam-Hoi Cheng:
A Constant Response Time Simultaneous Access Dictionary Machine. ACM Conference on Computer Science 1994: 203-209 - [c13]P. R. Venkata Subramaniam, Kam-Hoi Cheng:
Simultaneous access renegable priority queues. SPDP 1994: 370-376 - 1993
- [j16]Kam-Hoi Cheng, Qingzhou Wang:
A Simultaneous Access Design for Idle Processor Reactivation and the Detection of the Termination of a Parallel Activity. J. Parallel Distributed Comput. 17(4): 370-373 (1993) - 1992
- [j15]Keqin Li, Kam-Hoi Cheng:
Heuristic Algorithms for On-Line Packing in Three Dimensions. J. Algorithms 13(4): 589-605 (1992) - [j14]Qingzhou Wang, Kam-Hoi Cheng:
A Heuristic of Scheduling Parallel Tasks and its Analysis. SIAM J. Comput. 21(2): 281-294 (1992) - 1991
- [j13]Keqin Li, Kam-Hoi Cheng:
Worst case performance analysis of the two dimensional binary buddy system. Int. J. Comput. Math. 38(3-4): 123-132 (1991) - [j12]Quingzhou Wang, Kam-Hoi Cheng:
List Scheduling of Parallel Tasks. Inf. Process. Lett. 37(5): 291-297 (1991) - [j11]Keqin Li, Kam-Hoi Cheng:
A Two-Dimensional Buddy System for Dynamic Resource Allocation in a Partitionable Mesh Connected System. J. Parallel Distributed Comput. 12(1): 79-83 (1991) - [j10]Zhenqiang Fan, Kam-Hoi Cheng:
A Generalized Simultaneous Access Dictionary Machine. IEEE Trans. Parallel Distributed Syst. 2(2): 149-159 (1991) - [j9]Keqin Li, Kam-Hoi Cheng:
Job Scheduling in a Partitionable Mesh Using a Two-Dimensional Buddy System Partitioning Scheme. IEEE Trans. Parallel Distributed Syst. 2(4): 413-422 (1991) - 1990
- [j8]Keqin Li, Kam-Hoi Cheng:
Generalized First-Fit Algorithms in Two and Three Dimensions. Int. J. Found. Comput. Sci. 1(2): 131-150 (1990) - [j7]Kam-Hoi Cheng:
A Simultaneous Access Queue. J. Parallel Distributed Comput. 9(1): 83-86 (1990) - [j6]Zhenqiang Fan, Kam-Hoi Cheng:
Design and Analysis of Simultaneous Access Priority Queues. J. Parallel Distributed Comput. 9(4): 387-397 (1990) - [j5]Keqin Li, Kam-Hoi Cheng:
Static Job Scheduling in Partitionable Mesh Connected Systems. J. Parallel Distributed Comput. 10(2): 152-159 (1990) - [j4]Keqin Li, Kam-Hoi Cheng:
On Three-Dimensional Packing. SIAM J. Comput. 19(5): 847-867 (1990) - [c12]Keqin Li, Kam-Hoi Cheng:
A Two Dimensional Buddy System for Dynamic Resource Allocation in a Partitionable Mesh Connected System. ACM Conference on Computer Science 1990: 22-27 - [c11]Keqin Li, Kam-Hoi Cheng:
Job Scheduling in PMCS Using a 2DBS as the System Partitioning Scheme. ICPP (1) 1990: 119-122 - [c10]Zhenqiang Fan, Kam-Hoi Cheng:
A Data Flow Architecture Implementation. ICPP (1) 1990: 577-578 - [c9]Zhenqiang Fan, Kam-Hoi Cheng:
A Generalized Simultaneous Access Dictionary Machine. ICPP (1) 1990: 597-598 - [c8]Qingzhou Wang, Kam-Hoi Cheng:
A Heuristic Algorithm for the k-Center Problem with Vertex Weight. SIGAL International Symposium on Algorithms 1990: 388-396 - [c7]Qingzhou Wang, Kam-Hoi Cheng:
Parallel time complexity of a heuristic algorithm for the k-center problem with usage weights. SPDP 1990: 254-257
1980 – 1989
- 1989
- [j3]Kam-Hoi Cheng, Sartaj Sahni:
A new VLSI system for adaptive recursive filtering. Parallel Comput. 10(1): 109-115 (1989) - [j2]Kam-Hoi Cheng, Sartaj Sahni:
VLSI architectures for back substitution. Parallel Comput. 12(1): 53-69 (1989) - [c6]Keqin Li, Kam-Hoi Cheng:
Job Scheduling in Partitionable Mesh Connected Systems. ICPP (2) 1989: 65-72 - [c5]Zhenqiang Fan, Kam-Hoi Cheng:
A Simultaneous Access Priority Queue. ICPP (1) 1989: 95-98 - 1988
- [c4]Kam-Hoi Cheng:
Efficient Designs of Priority Queue. ICPP (1) 1988: 363-366 - 1987
- [j1]Kam-Hoi Cheng, Sartaj Sahni:
VLSI systems for band matrix multiplication. Parallel Comput. 4(3): 239-258 (1987) - 1986
- [c3]Kam-Hoi Cheng, Sartaj Sahni:
A New VLSI System for Adaptive Recursive Filtering. ICPP 1986: 387-389 - [c2]Kam-Hoi Cheng, Sartaj Sahni:
VLSI Artchitectures for Back Substitution. IFIP Congress 1986: 373-378 - 1985
- [c1]Kam-Hoi Cheng, Sartaj Sahni:
VLSI Systems For Matrix Multiplication. FSTTCS 1985: 428-456
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint