3341 search results - page 299 / 669 » On Bounded Queries and Approximation |
299
click to vote
ICDE
2002
IEEE
16 years 8 months ago
2002
IEEE
We propose a novel approach to shape-based image retrieval that builds upon a similarity criterion which is based on the average point set distance. Compared to traditional techni...
178
click to vote
ICDE
2010
IEEE
16 years 6 months ago
2010
IEEE
A supergraph containment search is to retrieve the data graphs contained by a query graph. In this paper, we study the problem of efficiently retrieving all data graphs approximate...
182
click to vote
SCCC
1997
IEEE
15 years 11 months ago
1997
IEEE
A cooperative database allows the user to specify approximate or vague query conditions. A vague query requires the database system to rank the retrieved answers according to thei...
186
click to vote
COMPGEOM
2004
ACM
16 years 5 days ago
2004
ACM
We consider the problem of approximate range counting over streams of d-dimensional points. In the data stream model, the algorithm makes a single scan of the data, which is prese...
209
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...