3894 search results - page 219 / 779 » Approximation Algorithms for Biclustering Problems |
171
click to vote
KDD
2000
ACM
15 years 10 months ago
2000
ACM
Information extraction is one of the most important techniques used in Text Mining. One of the main problems in building information extraction (IE) systems is that the knowledge ...
152
click to vote
NIPS
2007
15 years 8 months ago
2007
In many structured prediction problems, the highest-scoring labeling is hard to compute exactly, leading to the use of approximate inference methods. However, when inference is us...
152
click to vote
SPIRE
2005
Springer
16 years 1 days ago
2005
Springer
Let A and B be strings with lengths m and n, respectively, over a finite integer alphabet. Two classic string mathing problems are computing the edit distance between A and B, and...
154
click to vote
APPROX
2006
Springer
15 years 10 months ago
2006
Springer
Inspired by Feige (36th STOC, 2004), we initiate a study of sublinear randomized algorithms for approximating average parameters of a graph. Specifically, we consider the average ...
297
click to vote
ICDE
2008
IEEE
16 years 8 months ago
2008
IEEE
Abstract-- We investigate the problem of clustering on distributed data streams. In particular, we consider the k-median clustering on stream data arriving at distributed sites whi...