Sciweavers

1038 search results - page 36 / 208
» Space-Bounded Query Approximation
Sort
View
ESA
2007
Springer
188views Algorithms» more  ESA 2007»
15 years 5 months ago
Fast and Compact Oracles for Approximate Distances in Planar Graphs
We present an experimental evaluation of an approximate distance oracle recently suggested by Thorup [1] for undirected planar graphs. The oracle uses the existence of graph separa...
Laurent Flindt Muller, Martin Zachariasen
JIIS
2002
141views more  JIIS 2002»
14 years 11 months ago
Combining Approximation Techniques and Vector Quantization for Adaptable Similarity Search
Adaptable similarity queries based on quadratic form distance functions are widely popular in data mining application domains including multimedia, CAD, molecular biology or medica...
Christian Böhm, Hans-Peter Kriegel, Thomas Se...
STOC
2001
ACM
139views Algorithms» more  STOC 2001»
16 years 16 hour ago
Approximate distance oracles
Let G = (V, E) be an undirected weighted graph with |V | = n and |E| = m. Let k 1 be an integer. We show that G = (V, E) can be preprocessed in O(kmn1/k ) expected time, construc...
Mikkel Thorup, Uri Zwick
SPIRE
2009
Springer
15 years 6 months ago
A Last-Resort Semantic Cache for Web Queries
We propose a method to evaluate queries using a last-resort semantic cache in a distributed Web search engine. The cache stores a group of frequent queries and for each of these qu...
Flavio Ferrarotti, Mauricio Marín, Marcelo ...
JCP
2007
118views more  JCP 2007»
14 years 11 months ago
Dynamic Nonuniform Data Approximation in Databases with Haar Wavelet
Abstract— Data synopsis is a lossy compressed representation of data stored into databases that helps the query optimizer to speed up the query process, e.g. time to retrieve the...
Su Chen, Antonio Nucci