8699 search results - page 1668 / 1740 » Elements of the Theory of Computation |
203
click to vote
POPL
2003
ACM
15 years 11 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...
139
Voted
STOC
2007
ACM
15 years 11 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
15 years 11 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...
114
click to vote
ICALP
2009
Springer
15 years 11 months ago
2009
Springer
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
193
click to vote
VLDB
2007
ACM
15 years 11 months ago
2007
ACM
Views over probabilistic data contain correlations between tuples, and the current approach is to capture these correlations using explicit lineage. In this paper we propose an al...