210 search results - page 13 / 42 » On the Structure of Bounded Queries to Arbitrary NP Sets |
117
click to vote
DCC
2006
IEEE
16 years 5 months ago
2006
IEEE
Abstract. We propose measures for compressed data structures, in which space usage is measured in a data-aware manner. In particular, we consider the fundamental dictionary problem...
159
click to vote
ICML
2009
IEEE
16 years 6 months ago
2009
IEEE
We introduce a new algorithm for binary classification in the selective sampling protocol. Our algorithm uses Regularized Least Squares (RLS) as base classifier, and for this reas...
179
click to vote
ALGORITHMICA
2011
15 years 1 months ago
2011
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...
158
click to vote
COLT
2007
Springer
16 years 7 days ago
2007
Springer
We present a new class of problems, called resource-bounded information gathering for correlation clustering. Our goal is to perform correlation clustering under circumstances in w...
190
click to vote
FOCS
2008
IEEE
16 years 15 days ago
2008
IEEE
Dynamic connectivity is a well-studied problem, but so far the most compelling progress has been confined to the edge-update model: maintain an understanding of connectivity in a...