1888 search results - page 165 / 378 » Algorithms for Querying by Spatial Structure |
133
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
We prove lower bounds on the redundancy necessary to represent a set S of objects using a number of bits close to the information-theoretic minimum log2 |S|, while answering vario...
270
click to vote
ICDE
2009
IEEE
16 years 6 months ago
2009
IEEE
Keyword queries enjoy widespread usage as they represent an intuitive way of specifying information needs. Recently, answering keyword queries on graph-structured data has emerged ...
148
Voted
EDBT
2010
ACM
15 years 11 months ago
2010
ACM
Although keyword query enables inexperienced users to easily search XML database with no specific knowledge of complex structured query languages or XML data schemas, the ambigui...
108
click to vote
ESORICS
2009
Springer
16 years 5 months ago
2009
Springer
Abstract. A range of attacks on network components, such as algorithmic denial-of-service attacks and cryptanalysis via timing attacks, are enabled by data structures for which an ...
201
click to vote
CORR
1999
Springer
15 years 4 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...