10901 search results - page 341 / 2181 » Approximations in Distributed Optimization |
177
click to vote
ALT
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. We present the first (to our knowledge) approximation algorithm for tensor clustering—a powerful generalization to basic 1D clustering. Tensors are increasingly common...
198
click to vote
ESA
2005
Springer
16 years 6 days ago
2005
Springer
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
166
click to vote
SDM
2007
SIAM
15 years 8 months ago
2007
SIAM
Consensus clustering has emerged as one of the principal clustering problems in the data mining community. In recent years the theoretical computer science community has generated...
156
click to vote
WINE
2009
Springer
16 years 1 months ago
2009
Springer
We propose approximation algorithms under game-theoretic considerations. We indroduce and study the general covering problem which is a natural generalization of the well-studied m...
140
click to vote
ICALP
2007
Springer
16 years 28 days ago
2007
Springer
Say that f : {0, 1}n → {0, 1} -approximates g : {0, 1}n → {0, 1} if the functions disagree on at most an fraction of points. This paper contains two results about approximatio...