3341 search results - page 16 / 669 » On Bounded Queries and Approximation |
VLDB
2004
ACM
14 years 1 months ago
2004
ACM
Top-k queries based on ranking elements of multidimensional datasets are a fundamental building block for many kinds of information discovery. The best known general-purpose algor...
PAMI
2011
13 years 3 months ago
2011
—Subspaces offer convenient means of representing information in many pattern recognition, machine vision, and statistical learning applications. Contrary to the growing populari...
STOC
2009
ACM
14 years 9 months ago
2009
ACM
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
CVPR
2007
IEEE
14 years 10 months ago
2007
IEEE
Linear and affine subspaces are commonly used to describe appearance of objects under different lighting, viewpoint, articulation, and identity. A natural problem arising from the...
BIOINFORMATICS
2011
13 years 1 days ago
2011
We consider the problem of similarity queries in biological network databases. Given a database of networks, similarity query returns all the database networks whose similarity (i...