3415 search results - page 501 / 683 » Lower bounds on kernelization |
170
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
191
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
The central goal of data stream algorithms is to process massive streams of data using sublinear storage space. Motivated by work in the database community on outsourcing database...
191
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
193
click to vote
SIGMOD
2001
ACM
16 years 6 months ago
2001
ACM
Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data....
165
click to vote
ALT
2006
Springer
16 years 3 months ago
2006
Springer
Most of the existing active learning algorithms are based on the realizability assumption: The learner’s hypothesis class is assumed to contain a target function that perfectly c...