Sciweavers

3341 search results - page 25 / 669
» On Bounded Queries and Approximation
Sort
View
SIGMETRICS
2011
ACM
208views Hardware» more  SIGMETRICS 2011»
12 years 11 months ago
Structure-aware sampling on data streams
The massive data streams observed in network monitoring, data processing and scientific studies are typically too large to store. For many applications over such data, we must ob...
Edith Cohen, Graham Cormode, Nick G. Duffield
CVPR
2009
IEEE
15 years 3 months ago
Learning query-dependent prefilters for scalable image retrieval
We describe an algorithm for similar-image search which is designed to be efficient for extremely large collections of images. For each query, a small response set is selected by...
Lorenzo Torresani (Dartmouth College), Martin Szum...
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
14 years 1 months ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
SEMWEB
2010
Springer
13 years 6 months ago
Combining Approximation and Relaxation in Semantic Web Path Queries
We develop query relaxation techniques for regular path queries and combine them with query approximation in order to support flexible querying of RDF data when the user lacks know...
Alexandra Poulovassilis, Peter T. Wood
FQAS
2009
Springer
127views Database» more  FQAS 2009»
14 years 3 months ago
Finding Top-k Approximate Answers to Path Queries
We consider the problem of finding and ranking paths in semistructured data without necessarily knowing its full structure. The query language we adopt comprises conjunctions of r...
Carlos A. Hurtado, Alexandra Poulovassilis, Peter ...