5964 search results - page 1117 / 1193 » A theory of speculative computation |
101
Voted
KDD
2005
ACM
16 years 27 days ago
2005
ACM
Dyadic data matrices, such as co-occurrence matrix, rating matrix, and proximity matrix, arise frequently in various important applications. A fundamental problem in dyadic data a...
110
click to vote
KDD
2004
ACM
16 years 27 days 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...
222
Voted
POPL
2003
ACM
16 years 25 days 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...
157
Voted
STOC
2007
ACM
16 years 24 days 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...
104
click to vote
STOC
2006
ACM
16 years 24 days 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...