Sciweavers

804 search results - page 51 / 161
» The Need for Speed
Sort
View
NJC
2000
99views more  NJC 2000»
13 years 8 months ago
An Incremental Unique Representation for Regular Trees
In order to deal with infinite regular trees (or other pointed graph structures) efficiently, we give new algorithms to store such structures. The trees are stored in such a way th...
Laurent Mauborgne
PR
2000
129views more  PR 2000»
13 years 8 months ago
Personal identification based on handwriting
In this paper, a novel algorithm is presented for writer identification from handwritings. Principal Component Analysis is applied to the gray-scale handwriting images to find a s...
H. E. S. Said, T. N. Tan, Keith D. Baker
SIGPLAN
1998
13 years 8 months ago
Optimizing Away C++ Exception Handling
A high performance implementation of C++ exception handling is crucial, because exception handling overhead is distributed across all code. The commonly-used table-driven approach...
Jonathan L. Schilling
SIGMOD
2002
ACM
106views Database» more  SIGMOD 2002»
13 years 8 months ago
A Study on the Management of Semantic Transaction for Efficient Data Retrieval
Mobile computing technology is developing rapidly due to the advantages of information access through mobile devices and the need to retrieve information at remote locations. Howe...
Shi-Ming Huang, Irene S. Y. Kwan, Chih-He Li
TIP
2002
116views more  TIP 2002»
13 years 8 months ago
Adaptive approximate nearest neighbor search for fractal image compression
Fractal image encoding is a computationally intensive method of compression due to its need to find the best match between image sub-blocks by repeatedly searching a large virtual...
Chong Sze Tong, Man Wong