210 search results - page 18 / 42 » On the Structure of Bounded Queries to Arbitrary NP Sets |
122
click to vote
JCT
2011
14 years 8 months ago
2011
For a positive integer n that is not a power of 2, precisely the same family of convex polygons with n sides is optimal in three different geometric problems. These polygons have ...
198
click to vote
ICDE
2007
IEEE
16 years 2 months ago
2007
IEEE
Traditional approaches for efficiently processing historical queries, where a history is a multidimensional timeseries, employ a two step filter-and-refine scheme. In the filter s...
165
click to vote
DIMACS
1996
15 years 2 months ago
1996
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
123
click to vote
SIGMOD
2003
ACM
16 years 1 months ago
2003
ACM
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In ...
224
click to vote
ICDE
2000
IEEE
16 years 2 months ago
2000
IEEE
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...