5115 search results - page 388 / 1023 » On Randomized Lanczos Algorithms |
202
Voted
DIALM
2008
ACM
15 years 9 months ago
2008
ACM
In this work we analyze the complexity of local broadcasting in the physical interference model. We present two distributed randomized algorithms: one that assumes that each node ...
222
click to vote
CVPR
2008
IEEE
16 years 9 months ago
2008
IEEE
The notion of using context information for solving highlevel vision problems has been increasingly realized in the field. However, how to learn an effective and efficient context...
157
Voted
ECML
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. In their search through a huge space of possible hypotheses, rule induction algorithms compare estimations of qualities of a large number of rules to find the one that ap...
167
click to vote
STOC
1995
ACM
15 years 11 months ago
1995
ACM
We present a new class of asymptotically good, linear error-correcting codes. These codes can be both encoded and decoded in linear time. They can also be encoded by logarithmic-d...
161
Voted
SODA
2001
ACM
15 years 9 months ago
2001
ACM
We propose a discrete variant of the Bak-Sneppen model for self-organized criticality. In this process, a configuration is an n-bit word, and at each step one chooses a random bit...