7006 search results - page 624 / 1402 » Approximation Algorithms |
174
click to vote
ICMCS
2006
IEEE
16 years 1 months ago
2006
IEEE
This paper proposes an algorithm for distributed classification, based on a SVM scheme. The contribution of each support vector is approximated by low complexity distributed thre...
220
click to vote
STACS
2007
Springer
16 years 1 months ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
186
click to vote
AAAI
1997
15 years 8 months ago
1997
We present empirical evidence that the distribution of e ort required to solve CSPs randomly generated at the 50% satis able point, when using a backtracking algorithm, can be app...
209
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
We present reductions from lattice problems in the 2 norm to the corresponding problems in other norms such as 1, (and in fact in any other p norm where 1 p ). We consider latt...
202
click to vote
WADS
2005
Springer
16 years 23 days ago
2005
Springer
Important generalizations of the Vertex Cover problem (Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in terms of...