4940 search results - page 204 / 988 » On the Complexity of Universal Programs |
177
click to vote
MST
2007
15 years 6 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 ...
196
click to vote
ICOODB
2010
15 years 5 months ago
2010
Abstract. New emerging applications including genomic, multimedia, and geospatial technologies have necessitated the handling of complex application objects that are highly structu...
216
click to vote
SIAMCOMP
2010
15 years 4 months ago
2010
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
168
click to vote
IUI
2009
ACM
16 years 3 months ago
2009
ACM
Selection tasks are common in modern computer interfaces: we are often required to select a set of files, emails, data entries, and the like. File and data browsers have sorting a...
184
click to vote
ICALP
2004
Springer
15 years 11 months ago
2004
Springer
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...