3341 search results - page 116 / 669 » On Bounded Queries and Approximation |
FSE
2007
Springer
15 years 4 months ago
2007
Springer
We provide new security proofs for PMAC, TMAC, and XCBC message authentication modes. The previous security bounds for these modes were σ2 /2n , where n is the block size in bits ...
SSDBM
2010
IEEE
15 years 3 months ago
2010
IEEE
Many applications require to determine the k-nearest neighbors for multiple query points simultaneously. This task is known as all-(k)-nearest-neighbor (AkNN) query. In this paper,...
AAAI
2006
14 years 11 months ago
2006
In this paper, we motivate the need for and challenges involved in supporting imprecise queries over Web databases. Then we briefly explain our solution, AIMQ - a domain independe...
166
click to vote
SIGMOD
2009
ACM
15 years 10 months ago
2009
ACM
We propose a language-model-based ranking approach for SPARQLlike queries on entity-relationship graphs. Our ranking model supports exact matching, approximate structure matching,...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
The crossing number of a graph is the least number of pairwise edge crossings in a drawing of the graph in the plane. We provide an O(n log n) time constant factor approximation al...