1389 search results - page 157 / 278 » Improved Approximation Algorithms for Label Cover Problems |
123
click to vote
NAACL
2010
15 years 1 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...
158
click to vote
ISCAS
2008
IEEE
15 years 9 months ago
2008
IEEE
— Non-negative matrix factorization (NMF), i.e. V ≈ WH where both V, W and H are non-negative has become a widely used blind source separation technique due to its part based r...
124
click to vote
JCO
2000
15 years 3 months ago
2000
We consider the problem of off-line throughput maximization for job scheduling on one or more machines, where each job has a release time, a deadline and a profit. Most of the ver...
135
click to vote
STOC
2006
ACM
16 years 3 months ago
2006
ACM
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...
191
click to vote
CORR
1999
Springer
15 years 2 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...