Sciweavers

7015 search results - page 133 / 1403
» Approximation algorithms for co-clustering
Sort
View
SODA
2010
ACM
238views Algorithms» more  SODA 2010»
14 years 6 months ago
How good is the Chord algorithm?
The Chord algorithm is a popular, simple method for the succinct approximation of curves, which is widely used, under different names, in a variety of areas, such as, multiobjecti...
Constantinos Daskalakis, Ilias Diakonikolas, Mihal...
STOC
2007
ACM
154views Algorithms» more  STOC 2007»
14 years 9 months ago
Improved approximation for directed cut problems
Amit Agarwal, Noga Alon, Moses Charikar
STOC
2006
ACM
95views Algorithms» more  STOC 2006»
14 years 9 months ago
Conditional hardness for approximate coloring
Irit Dinur, Elchanan Mossel, Oded Regev
STOC
2002
ACM
119views Algorithms» more  STOC 2002»
14 years 9 months ago
The complexity of approximating entropy
Tugkan Batu, Sanjoy Dasgupta, Ravi Kumar, Ronitt R...
APPROX
2009
Springer
93views Algorithms» more  APPROX 2009»
14 years 3 months ago
PASS Approximation
Uriel Feige, Nicole Immorlica, Vahab S. Mirrokni, ...