210 search results - page 25 / 42 » On the Structure of Bounded Queries to Arbitrary NP Sets |
IR
2008
13 years 8 months ago
2008
We consider the following autocompletion search scenario: imagine a user of a search engine typing a query; then with every keystroke display those completions of the last query wo...
VLDB
2007
ACM
14 years 8 months ago
2007
ACM
The modeling of high level semantic events from low level sensor signals is important in order to understand distributed phenomena. For such content-modeling purposes, transformat...
BTW
2007
Springer
14 years 19 days ago
2007
Springer
: The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, has received increasing a...
PODS
1997
ACM
14 years 24 days ago
1997
ACM
In this paper, we present a new cost model for nearest neighbor search in high-dimensional data space. We first analyze different nearest neighbor algorithms, present a generaliza...
CADE
2005
Springer
14 years 9 months ago
2005
Springer
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...