default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHuizhu Lu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2000
[c18]Langtsan G. Wu, Huizhu Lu:
F3MCNN: A Fuzzy Minimum Mean Maximum Clustering Neural Network. SAC (1) 2000: 10-14
1990 – 1999
- 1999
- [c17]Nobuyuki Nezu, Huizhu Lu:
Modeling Deflection Networks: Design and Specification. SAC 1999: 66-73 - 1998
- [c16]Sei Chun, Huizhu Lu, Jonghoon Chun:
Succinct model semantics: a simple model for inclusive interpretations. SAC 1998: 39-44 - [c15]Nobuyuki Nezu, Huizhu Lu:
Incremental construction of torus networks. SAC 1998: 80-84 - 1997
- [c14]Nobuyuki Nezu, Huizhu Lu:
Incremental Design and Routing Schemes for Torus Networks. PDPTA 1997: 1302-1307 - 1996
- [c13]Kap S. Bang, Huizhu Lu:
The PML-Tree: An Efficient Parallel Spatial Index Structure for Spatial Databases. ACM Conference on Computer Science 1996: 79-88 - [c12]Nobuyuki Nezu, Huizhu Lu:
An Asynchronous Address Updating Scheme for Expanding Torus Networks. PDPTA 1996: 407-415 - 1995
- [c11]Kap S. Bang, Huizhu Lu:
SMR-tree: an efficient index structure for spatial databases. SAC 1995: 46-50 - 1992
- [c10]Zhengou Wang, Huizhu Lu, Marvin Stone:
A Message Priority Assignment Algorithm for CAN Based Networks. ACM Conference on Computer Science 1992: 25-32 - [c9]D. Weifang Doong, Huizhu Lu, George E. Hedrick:
An interleaving technique for block coding of black-and-white facsimile data. SAC 1992: 37-45 - [c8]Zhengou Wang, Huizhu Lu, George E. Hedrick, Marvin Stone:
Message delay analysis for CAN based networks. SAC 1992: 89-94 - [c7]Nalini Hosur, Huizhu Lu, George E. Hedrick:
Dynamic addition and removal of attributes in BANG files. SAC 1992: 210-216 - [c6]Xiaoming Cheng, Huizhu Lu, George E. Hedrick:
Searching spatial objects with index by dimensional projections. SAC 1992: 217-223 - [c5]Faisel Saeed, K. M. George, Huizhu Lu:
Image contrast enhancement using fuzzy set theory. SAC 1992: 405-411 - [c4]Kim S. Lee, Huizhu Lu, D. D. Fisher:
A hierarchical single-key-lock access control using the Chinese remainder theorem. SAC 1992: 491-496 - 1991
- [j1]Huizhu Lu, Samuel C. Lee:
A new approach to solve the sequence-length constraint problem in circular convolution using number theoretic transform. IEEE Trans. Signal Process. 39(6): 1314-1321 (1991) - 1990
- [c3]Ashok Rathi, Huizhu Lu, George E. Hedrick:
Performance Comparison of Extendible Hashing and Linear Hashing Techniques. SIGSMALL/PC Symposium 1990: 178-185
1980 – 1989
- 1989
- [c2]Sei H. Chun, George E. Hedrick, Huizhu Lu, D. D. Fisher:
A partitioning method for grid file directories. COMPSAC 1989: 271-277 - 1988
- [c1]Samuel C. Lee, Huizhu Lu:
Fast convolution using generalized Fermat/Mersenne number transforms. ICASSP 1988: 1910-1913
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:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
