7015 search results - page 53 / 1403 » Approximation algorithms for co-clustering |
FCT
2003
Springer
14 years 2 months ago
2003
Springer
Abstract. The NP-complete Distinguishing Substring Selection problem (DSSS for short) asks, given a set of “good” strings and a set of “bad” strings, for a solution string ...
NIPS
2000
13 years 10 months ago
2000
A new incremental learning algorithm is described which approximates the maximal margin hyperplane w.r.t. norm p 2 for a set of linearly separable data. Our algorithm, called alm...
AAAI
2010
13 years 10 months ago
2010
We consider approval voting elections in which each voter votes for a (possibly empty) set of candidates and the outcome consists of a set of k candidates for some parameter k, e....
DCG
2010
13 years 9 months ago
2010
We consider the well known geometric problem of determining shortest paths between pairs of points on a polyhedral surface P, where P consists of triangular faces with positive we...
STACS
2005
Springer
14 years 2 months ago
2005
Springer
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...