427 search results - page 31 / 86 » A Subexponential Bound for Linear Programming |
111
Voted
CINQ
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
91
Voted
ICCV
2009
IEEE
16 years 6 months ago
2009
IEEE
User-provided object bounding box is a simple and
popular interaction paradigm considered by many existing
interactive image segmentation frameworks. However,
these frameworks t...
120
click to vote
ICALP
2005
Springer
15 years 7 months ago
2005
Springer
We prove new lower bounds for locally decodable codes and private information retrieval. We show that a 2-query LDC encoding nbit strings over an ℓ-bit alphabet, where the decode...
133
click to vote
MFCS
2009
Springer
15 years 6 months ago
2009
Springer
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
110
click to vote
CORR
2010
Springer
14 years 12 months ago
2010
Springer
This paper presents several novel theoretical results regarding the recovery of a low-rank matrix from just a few measurements consisting of linear combinations of the matrix entr...