Sciweavers

4850 search results - page 533 / 970
» Approximate Data Structures with Applications
Sort
View
ALGORITHMICA
2005
108views more  ALGORITHMICA 2005»
15 years 7 months ago
Key-Independent Optimality
A new form of optimality for comparison based static dictionaries is introduced. This type of optimality, keyindependent optimality, is motivated by applications that assign key v...
John Iacono
CLUSTER
2005
IEEE
16 years 25 days ago
Fast Query Processing by Distributing an Index over CPU Caches
Data intensive applications on clusters often require requests quickly be sent to the node managing the desired data. In many applications, one must look through a sorted tree str...
Xiaoqin Ma, Gene Cooperman
CIKM
2003
Springer
16 years 13 days ago
High dimensional reverse nearest neighbor queries
Reverse Nearest Neighbor (RNN) queries are of particular interest in a wide range of applications such as decision support systems, profile based marketing, data streaming, docum...
Amit Singh, Hakan Ferhatosmanoglu, Ali Saman Tosun
ECCV
2010
Springer
15 years 8 months ago
Intrinsic Regularity Detection in 3D Geometry
Abstract. Automatic detection of symmetries, regularity, and repetitive structures in 3D geometry is a fundamental problem in shape analysis and pattern recognition with applicatio...
Niloy J. Mitra, Alexander M. Bronstein, Michael M....
IADIS
2003
15 years 8 months ago
Model Driven Fast Prototyping: A Semantic Approach
Sure that quality applications must be well thought and described before the development phase and that a design methodology can be much more than a help in most occasions, we pro...
Luca Contursi, Roberto Paiano, Andrea Pandurino