3341 search results - page 69 / 669 » On Bounded Queries and Approximation |
162
click to vote
ICDE
1996
IEEE
15 years 11 months ago
1996
IEEE
Many new database application domains such as experimental sciences and medicine are characterized by large sequences as their main form of data. Using approximate representation ...
FOCS
2007
IEEE
15 years 4 months ago
2007
IEEE
We show that every construction of one-time signature schemes from a random oracle achieves black-box security at most 2(1+o(1))q , where q is the total number of oracle queries a...
105
click to vote
AAAI
2000
14 years 11 months ago
2000
Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...
183
click to vote
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
Exploiting the concepts of social networking represents a novel approach to the approximate similarity query processing. We present a metric social network where relations between...
CCCG
2006
14 years 11 months ago
2006
For a given point set in Euclidean space we consider the problem of finding (approximate) nearest neighbors of a query point but restricting only to points that lie within a fixed...