5115 search results - page 268 / 1023 » On Randomized Lanczos Algorithms |
211
click to vote
INFOCOM
2005
IEEE
16 years 23 days ago
2005
IEEE
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
201
click to vote
STOC
1997
ACM
15 years 11 months ago
1997
ACM
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution π on an...
207
click to vote
SIGMOD
1998
ACM
15 years 11 months ago
1998
ACM
Clustering, in data mining, is useful for discovering groups and identifying interesting distributions in the underlying data. Traditional clustering algorithms either favor clust...
181
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
230
click to vote
ESA
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. This paper addresses strategies for the stable marriage problem. For the Gale-Shapley algorithm with men proposing, a classical theorem states that it is impossible for e...