1038 search results - page 116 / 208 » Space-Bounded Query Approximation |
125
click to vote
FOCS
2006
IEEE
15 years 10 months ago
2006
IEEE
We investigate the optimality of (1+ )-approximation algorithms obtained via the dimensionality reduction method. We show that: • Any data structure for the (1 + )-approximate n...
249
click to vote
ICDE
2006
IEEE
16 years 5 months ago
2006
IEEE
Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structu...
285
click to vote
ICDE
1996
IEEE
16 years 5 months ago
1996
IEEE
Eficient indezing of high dimensional feature vectors is important to allow visual information systems and a number other applications to scale up to large databases. In this pape...
182
click to vote
SISAP
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract—We propose a strategy to perform query processing on P2P similarity search systems based on peers and superpeers. We show that by approximating global but resumed inform...
138
click to vote
ESWS
2010
Springer
15 years 7 months ago
2010
Springer
The Semantic Web movement has led to the publication of thousands of ontologies online. These ontologies present and mediate information and knowledge on the Semantic Web. Tools ex...