807 search results - page 70 / 162 » Space Efficient Algorithms for Ordered Tree Comparison |
128
click to vote
SIGIR
2008
ACM
15 years 3 months ago
2008
ACM
Efficient similarity search in high-dimensional spaces is important to content-based retrieval systems. Recent studies have shown that sketches can effectively approximate L1 dist...
130
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
This paper proposes an efficient technique for partitioning large biometric database during identification. In this technique feature vector which comprises of global and local de...
220
click to vote
ICDE
2004
IEEE
16 years 5 months ago
2004
IEEE
Data cube computation and representation are prohibitively expensive in terms of time and space. Prior work has focused on either reducing the computation time or condensing the r...
119
click to vote
IWMM
2007
Springer
15 years 10 months ago
2007
Springer
This article presents a heap space analysis for (sequential) Java bytecode. The analysis generates heap space cost relations which define at compile-time the heap consumption of ...
167
click to vote
SIAMSC
2008
15 years 3 months ago
2008
A model-constrained adaptive sampling methodology is proposed for reduction of large-scale systems with high-dimensional parametric input spaces. Our model reduction method uses a ...