default search action
Siu-Cheung Chau
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
- [c25]Amira Ragab, Maher Ahmed, Siu-Cheung Chau:
Sign Language Recognition Using Hilbert Curve Features. ICIAR 2013: 143-151 - 2011
- [c24]Wegdan Abdelsalam, David Chiu, Siu-Cheung Chau, Yasser Ebrahim, Maher Ahmed:
Moving Object Modelling Approach for Lowering Uncertainty in Location Tracking Systems. Canadian AI 2011: 26-31 - 2010
- [c23]Yasser Ebrahim, Maher Ahmed, Siu-Cheung Chau, Wegdan Abdelsalam:
Significantly Improving Scan-Based Shape Representations Using Rotational Key Feature Points. ICIAR (1) 2010: 284-293
2000 – 2009
- 2009
- [j8]Yasser Ebrahim, Maher Ahmed, Wegdan Abdelsalam, Siu-Cheung Chau:
Shape representation and description using the Hilbert curve. Pattern Recognit. Lett. 30(4): 348-358 (2009) - [c22]Jeffrey Armstrong, Maher Ahmed, Siu-Cheung Chau:
A Rotation-Invariant Approach to 2D Shape Representation Using the Hilbert Curve. ICIAR 2009: 594-603 - [c21]Wegdan Abdelsalam, Siu-Cheung Chau, David Chiu, Maher Ahmed, Yasser Ebrahim:
ROOTS, The ROving Objects Trip Simulator. SSTD 2009: 445-449 - 2008
- [c20]Yasser Ebrahim, Maher Ahmed, Siu-Cheung Chau, Wegdan Abdelsalam:
Shape Matching Using a Novel Warping Distance Measure. ICIAR 2008: 465-474 - [c19]Yasser Ebrahim, Maher Ahmed, Siu-Cheung Chau, Wegdan Abdelsalam:
A Template-Based Shape Representation Technique. ICIAR 2008: 497-506 - [c18]Yasser Ebrahim, Maher Ahmed, Siu-Cheung Chau, Wegdan Abdelsalam:
A novel warping distance measure. ICIP 2008: 2172-2175 - 2007
- [c17]Yasser Ebrahim, Maher Ahmed, Siu-Cheung Chau, Wegdan Abdelsalam:
A View-Based 3D Object Shape Representation Technique. ICIAR 2007: 411-422 - [c16]Yasser Ebrahim, Maher Ahmed, Siu-Cheung Chau, Wegdan Abdelsalam:
An Efficient Shape Representation and Description Technique. ICIP (6) 2007: 441-444 - 2006
- [c15]Wegdan Abdelsalam, Yasser Ebrahim, Siu-Cheung Chau, Maher Ahmed:
A Roving User Modeling Framework for Location Tracking Applications. ITSC 2006: 169-174 - 2005
- [j7]Siu-Cheung Chau, Ada Wai-Chee Fu:
Optimal all-to-all personalised exchange in a novel optical multistage interconnection network. Int. J. High Perform. Comput. Netw. 3(1): 19-24 (2005) - [c14]Wegdan Abdelsalam, Yasser Ebrahim, Siu-Cheung Chau, Maher Ahmed:
A user modeling approach to improving estimation accuracy in location-tracking applications. AICCSA 2005: 105 - [c13]Yasser Ebrahim, Wegdan Abdelsalam, Maher Ahmed, Siu-Cheung Chau:
Proposing a hybrid tag-camera-based identification and navigation aid for the visually impaired. CCNC 2005: 172-177 - [c12]Siu-Cheung Chau, Tiehong Xiao, Ada Wai-Chee Fu:
Routing and Scheduling for a Novel Optical Multistage Interconnection Network. Euro-Par 2005: 984-993 - 2003
- [c11]Siu-Cheung Chau, Ada Wai-Chee Fu:
Load Balancing between Heterogeneous Computing Clusters. GCC (1) 2003: 75-82 - 2002
- [j6]Siu-Cheung Chau, Ada Wai-Chee Fu:
A Gracefully Degradable Declustered RAID Architecture. Clust. Comput. 5(1): 97-105 (2002) - 2000
- [c10]Siu-Cheung Chau, Ada Wai-Chee Fu:
A Gracefully Degradable Declustered RAID Architecture with near Optimal Maximal Read and Write Parallelism. CLUSTER 2000: 309-318 - [c9]Siu-Cheung Chau, Ada Wai-Chee Fu:
An Improved Direct Dimension Exchange Method for Load Balancing in k-ary n-cube Multicomputers. PDPTA 2000 - [c8]Siu-Cheung Chau, Ada Wai-Chee Fu:
A reconfigurable fault-tolerant hypercube architecture with global sparing. PRDC 2000: 156-168
1990 – 1999
- 1999
- [j5]Ada Wai-Chee Fu, Siu-Cheung Chau:
Locating Corruptions in a Replicated File in a Distributed Environment. J. Supercomput. 13(1): 71-97 (1999) - 1998
- [j4]Ada Wai-Chee Fu, Siu-Cheung Chau:
Cyclic-Cubes: A New Family of Interconnection Networks of Even Fixed-Degrees. IEEE Trans. Parallel Distributed Syst. 9(12): 1253-1268 (1998) - 1997
- [j3]Ke Wang, Weining Zhang, Siu-Cheung Chau:
Weakly Independent Database Schemes. Acta Informatica 34(1): 1-22 (1997) - 1996
- [c7]Ada Wai-Chee Fu, Siu-Cheung Chau:
Locating More Corruptions in a Replicated File. SRDS 1996: 168-177 - 1995
- [j2]Ke Wang, Weining Zhang, Siu-Cheung Chau:
Decomposition of Magic Rewriting. J. ACM 42(2): 329-381 (1995) - [j1]Weining Zhang, Ke Wang, Siu-Cheung Chau:
Data Partition and Parallel Evaluation of Datalog Programs. IEEE Trans. Knowl. Data Eng. 7(1): 163-176 (1995) - 1993
- [c6]Ke Wang, Weining Zhang, Siu-Cheung Chau:
Minimize Linear Mutual Recursion by Rule Unfolding. ICCI 1993: 98-102 - [c5]Siu-Cheung Chau:
On Implementing Large Fault-Tolerant Binary Tree Architecture in WSI. ICCI 1993: 145-149 - 1992
- [c4]Siu-Cheung Chau, Weining Zhang, Arthur L. Liestman:
Fault Tolerance for Multistage Interconnection Networks. ICCI 1992: 430-435 - 1991
- [c3]Siu-Cheung Chau, Arthur L. Liestman:
A Fault-Tolerant Binary Tree Architecture. ICCI 1991: 335-346 - [c2]Weining Zhang, Ke Wang, Siu-Cheung Chau:
Data partition: A Practical Parallel Evaluation of Datalog Programs. PDIS 1991: 98-105
1980 – 1989
- 1989
- [c1]Siu-Cheung Chau, Arthur L. Liestman:
A proposal for a fault-tolerant binary hypercube architecture. FTCS 1989: 323-330
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-25 05:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint