210 search results - page 7 / 42 » On the Structure of Bounded Queries to Arbitrary NP Sets |
140
click to vote
STOC
2012
ACM
13 years 2 months ago
2012
ACM
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
CCCG
2010
15 years 1 months ago
2010
We present a data structure for efficient axis-aligned orthogonal range search on a set of n lines in a bounded plane. The algorithm requires O(log n + k) time in the worst case t...
115
click to vote
JACM
2010
14 years 10 months ago
2010
We present a fully dynamic randomized data structure that can answer queries about the convex hull of a set of n points in three dimensions, where insertions take O(log3 n) expect...
SODA
2001
ACM
15 years 1 months ago
2001
ACM
Most information-retrieval systems preprocess the data to produce an auxiliary index structure. Empirically, it has been observed that there is a tradeoff between query response t...
STOC
2009
ACM
16 years 13 days 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...