5580 search results - page 198 / 1116 » Randomized priority algorithms |
127
click to vote
FOCM
2007
15 years 2 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...
135
click to vote
PAMI
1998
15 years 1 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...
110
click to vote
JACM
2010
15 years 23 days 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...
129
click to vote
CORR
2011
Springer
14 years 9 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...
104
click to vote
IPL
2007
15 years 2 months ago
2007
We give a randomized algorithm (the ”Wedge Algorithm”) of competitiveness 3 2 Hk − 1 2k for any metrical task system on a uniform space of k points, for any k ≥ 2, where H...