8512 search results - page 1631 / 1703 » Computing Theory With Relevance |
KDD
2004
ACM
14 years 8 months ago
2004
ACM
Essentially all data mining algorithms assume that the datagenerating process is independent of the data miner's activities. However, in many domains, including spam detectio...
POPL
2003
ACM
14 years 8 months ago
2003
ACM
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
STOC
2007
ACM
14 years 8 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
STOC
2006
ACM
14 years 8 months ago
2006
ACM
We consider the problem of randomness extraction from independent sources. We construct an extractor that can extract from a constant number of independent sources of length n, ea...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...