197 search results - page 23 / 40 » Improved Approximation Algorithms for Bipartite Correlation ... |
TCS
2010
13 years 5 months ago
2010
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...
ICDE
2009
IEEE
14 years 9 months ago
2009
IEEE
Abstract-- Answering approximate queries on string collections is important in applications such as data cleaning, query relaxation, and spell checking, where inconsistencies and e...
CIKM
2010
Springer
13 years 6 months ago
2010
Springer
In Latent Semantic Indexing (LSI), a collection of documents is often pre-processed to form a sparse term-document matrix, followed by a computation of a low-rank approximation to...
EUROPAR
2007
Springer
14 years 1 months ago
2007
Springer
The distributed nature of the grid results in the problem of scheduling parallel jobs produced by several independent organizations that have partial control over the system. We co...
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
The success of tensor-based subspace learning depends heavily on reducing correlations along the column vectors of the mode-k flattened matrix. In this work, we study the problem ...