1389 search results - page 158 / 278 » Improved Approximation Algorithms for Label Cover Problems |
140
click to vote
ORL
2006
15 years 3 months ago
2006
The strategic safety stock placement problem is a constrained separable concave minimization problem and so is solvable, in principle, as a sequence of mixed-integer programming p...
132
click to vote
PODC
2005
ACM
15 years 8 months ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
118
click to vote
FOCS
2007
IEEE
15 years 9 months ago
2007
IEEE
We continue the recent line of work on the connection between semidefinite programming-based approximation algorithms and the Unique Games Conjecture. Given any boolean 2-CSP (or...
103
click to vote
ICML
2006
IEEE
16 years 4 months ago
2006
IEEE
In this paper we study a new framework introduced by Vapnik (1998) and Vapnik (2006) that is an alternative capacity concept to the large margin approach. In the particular case o...
KES
2010
Springer
15 years 1 months ago
2010
Springer
Document clustering is a powerful technique that has been widely used for organizing data into smaller and manageable information kernels. Several approaches have been proposed...