7015 search results - page 101 / 1403 » Approximation algorithms for co-clustering |
ICCSA
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...
STOC
2003
ACM
14 years 9 months ago
2003
ACM
We show how to determine whether the edit distance between two given strings is small in sublinear time. Specifically, we present a test which, given two n-character strings A and...
NIPS
2004
13 years 10 months ago
2004
Existing algorithms for discrete partially observable Markov decision processes can at best solve problems of a few thousand states due to two important sources of intractability:...
SODA
1997
ACM
13 years 10 months ago
1997
ACM
The problem of fitting a straight line to a finite collection of points in the plane is an important problem in statistical estimation. Robust estimators are widely used because...
EDBT
2010
ACM
14 years 4 months ago
2010
ACM
The existing solutions to privacy preserving publication can be classified into the theoretical and heuristic categories. The former guarantees provably low information loss, whe...