2698 search results - page 408 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
180
click to vote
FOCS
2003
IEEE
15 years 11 months ago
2003
IEEE
We show that Yao’s XOR Lemma, and its essentially equivalent rephrasing as a Direct Product Lemma, can be re-interpreted as a way of obtaining error-correcting codes with good l...
227
click to vote
GOSLER
1995
15 years 10 months ago
1995
The present paper deals with the learnability of indexed families of uniformly recursive languages from positive data as well as from both, positive and negative data. We consider...
157
click to vote
NAACL
2010
15 years 4 months ago
2010
Extraction of entities from ad creatives is an important problem that can benefit many computational advertising tasks. Supervised and semi-supervised solutions rely on labeled da...
180
click to vote
LATIN
2010
Springer
15 years 4 months ago
2010
Springer
The packet routing problem, i.e., the problem to send a given set of unit-size packets through a network on time, belongs to one of the most fundamental routing problems with impor...
211
click to vote
SPIRE
2010
Springer
15 years 4 months ago
2010
Springer
The Longest Common Subsequence (LCS) of two or more strings is a fundamental well-studied problem which has a wide range of applications throughout computational sciences. When the...