5115 search results - page 148 / 1023 » On Randomized Lanczos Algorithms |
181
click to vote
STOC
2004
ACM
15 years 11 months ago
2004
ACM
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...
174
click to vote
FOCM
2007
15 years 6 months ago
2007
We consider the regression problem and describe an algorithm approximating the regression function by estimators piecewise constant on the elements of an adaptive partition. The pa...
185
click to vote
PAMI
1998
15 years 6 months ago
1998
—We propose a general synchronous model of lattice random fields which could be used similarly to Gibbs distributions in a Bayesian framework for image analysis, leading to algor...
163
click to vote
JACM
2010
15 years 4 months ago
2010
We present a linear expected time algorithm for finding maximum cardinality matchings in sparse random graphs. This is optimal and improves on previous results by a logarithmic f...
181
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants. T...