Sciweavers

5153 search results - page 213 / 1031
» Introduction to Randomized Algorithms
Sort
View
CDC
2008
IEEE
162views Control Systems» more  CDC 2008»
15 years 9 months ago
Average consensus by gossip algorithms with quantized communication
— This work studies how the randomized gossip algorithm can solve the average consensus problem on networks with quantized communications. The algorithm is proved to converge to ...
Paolo Frasca, Ruggero Carli, Fabio Fagnani, Sandro...
ICIP
2005
IEEE
15 years 9 months ago
Low complexity resolution progressive image coding algorithm: progres (progressive resolution decompression)
A very fast, low complexity algorithm for resolution scalable and random access decoding is presented. The algorithm avoids the multiple passes of bit-plane coding for speed impro...
Yushin Cho, William A. Pearlman, Amir Said
SIGMOD
2007
ACM
112views Database» more  SIGMOD 2007»
16 years 3 months ago
A random walk approach to sampling hidden databases
A large part of the data on the World Wide Web is hidden behind form-like interfaces. These interfaces interact with a hidden backend database to provide answers to user queries. ...
Arjun Dasgupta, Gautam Das, Heikki Mannila
135
Voted
ICPP
2008
IEEE
15 years 9 months ago
On the Design of Fast Pseudo-Random Number Generators for the Cell Broadband Engine and an Application to Risk Analysis
Numerical simulations in computational physics, biology, and finance, often require the use of high quality and efficient parallel random number generators. We design and optimi...
David A. Bader, Aparna Chandramowlishwaran, Virat ...
CP
2004
Springer
15 years 8 months ago
Understanding Random SAT: Beyond the Clauses-to-Variables Ratio
It is well known that the ratio of the number of clauses to the number of variables in a random k-SAT instance is highly correlated with the instance’s empirical hardness. We con...
Eugene Nudelman, Kevin Leyton-Brown, Holger H. Hoo...