Sciweavers

5115 search results - page 435 / 1023
» On Randomized Lanczos Algorithms
Sort
View
ICML
2004
IEEE
16 years 8 months ago
Approximate inference by Markov chains on union spaces
A standard method for approximating averages in probabilistic models is to construct a Markov chain in the product space of the random variables with the desired equilibrium distr...
Max Welling, Michal Rosen-Zvi, Yee Whye Teh
STOC
2006
ACM
134views Algorithms» more  STOC 2006»
16 years 8 months ago
Byzantine agreement in the full-information model in O(log n) rounds
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...
Michael Ben-Or, Elan Pavlov, Vinod Vaikuntanathan
COMPLEX
2009
Springer
16 years 2 months ago
Composing Music with Complex Networks
—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...
Xiaofan Liu, Chi Kong Tse, Michael Small
DRM
2007
Springer
16 years 1 months ago
Data structures for limited oblivious execution of programs while preserving locality of reference
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...
Avinash V. Varadarajan, Ramarathnam Venkatesan, C....
LCN
2006
IEEE
16 years 1 months ago
Bandwidth Aware Slot Allocation in Hybrid MAC
— 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...
Yuvraj. K. Rana, Bao Hua Liu, Alfandika Nyandoro, ...