608 search results - page 100 / 122 » On Dependent Randomized Rounding Algorithms |
120
Voted
STOC
2007
ACM
16 years 29 days ago
2007
ACM
The design of algorithms on complex networks, such as routing, ranking or recommendation algorithms, requires a detailed understanding of the growth characteristics of the network...
100
click to vote
AAAI
1998
15 years 2 months ago
1998
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...
106
Voted
STOC
2009
ACM
16 years 1 months ago
2009
ACM
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
102
click to vote
SPAA
1997
ACM
15 years 4 months ago
1997
ACM
Pipelining has been used in the design of many PRAM algorithms to reduce their asymptotic running time. Paul, Vishkin, and Wagener (PVW) used the approach in a parallel implementat...
STOC
2010
ACM
15 years 10 months ago
2010
ACM
We give near-optimal constructions of extractors secure against quantum bounded-storage adversaries. One instantiation gives the first such extractor to achieve an output length (...