3341 search results - page 211 / 669 » On Bounded Queries and Approximation |
167
click to vote
MST
2007
15 years 5 months ago
2007
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
156
click to vote
ENTCS
2007
15 years 5 months ago
2007
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether de...
211
click to vote
TSMC
2010
15 years 16 days ago
2010
We study the problem of projecting high-dimensional tensor data on an unspecified Riemannian manifold onto some lower dimensional subspace1 without much distorting the pairwise geo...
169
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
165
click to vote
DFG
2007
Springer
16 years 21 hour ago
2007
Springer
: The concept of natural neighbors employs the notion of distance to define local neighborhoods in discrete data. Especially when querying and accessing large scale data, it is im...