5138 search results - page 459 / 1028 » Randomized Algorithms for 3-SAT |
172
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
We present a randomized Byzantine Agreement (BA) protocol with an expected running time of O(log n) rounds, in a synchronous full-information network of n players. For any constan...
178
click to vote
COMPLEX
2009
Springer
16 years 1 months ago
2009
Springer
—In this paper we study the network structure in music and attempt to compose music artificially. Networks are constructed with nodes and edges corresponding to musical notes an...
152
click to vote
DRM
2007
Springer
16 years 1 months ago
2007
Springer
We introduce a data structure for program execution under a limited oblivious execution model. For fully oblivious execution along the lines of Goldreich and Ostrovsky [2], one tr...
179
click to vote
LCN
2006
IEEE
16 years 26 days ago
2006
IEEE
— Hybrid Medium Access Control (MAC) protocols combine the strength of random and schedule based MAC schemes. From random MAC schemes, Hybrid MAC protocols borrow flexibility an...
174
Voted
APPROX
2004
Springer
16 years 8 days ago
2004
Springer
While it is exponentially unlikely that a sparse random graph or hypergraph is connected, with probability 1 − o(1) such a graph has a “giant component” that, given its numbe...