7015 search results - page 27 / 1403 » Approximation algorithms for co-clustering |
AAAI
2008
13 years 10 months ago
2008
In this paper, we set up a framework to study approximation of manipulation, control, and bribery in elections. We show existence of approximation algorithms (even fully polynomia...
SODA
2012
ACM
11 years 10 months ago
2012
ACM
ABSTRACT∗ Arman Yousefi† Neal E. Young‡ Minimum-weight triangulation (MWT) is NP-hard. It has a polynomial-time constant-factor approximation algorithm, and a variety of e...
TRS
2008
13 years 7 months ago
2008
Abstract. For completely specified decision tables lower and upper approximations are unique, the lower approximation is the largest definable set contained in the approximated set...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
NIPS
2001
13 years 9 months ago
2001
Greedy approximation algorithms have been frequently used to obtain sparse solutions to learning problems. In this paper, we present a general greedy algorithm for solving a class...