5153 search results - page 142 / 1031 » Introduction to Randomized Algorithms |
125
Voted
APPROX
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...
118
Voted
ICML
2010
IEEE
15 years 3 months ago
2010
IEEE
We show that the mistake bound for predicting the nodes of an arbitrary weighted graph is characterized (up to logarithmic factors) by the cutsize of a random spanning tree of the...
117
click to vote
JDA
2008
15 years 2 months ago
2008
We show how to uniformly distribute data at random (not to be confounded with permutation routing) in two settings that are able to deal with massive data: coarse grained parallel...
108
Voted
ESA
1995
Springer
15 years 6 months ago
1995
Springer
We present a poly-log-competitive deterministic online algorithm for the online transportation problem on hierarchically separated trees when the online algorithm has one extra se...
117
click to vote
CVPR
2007
IEEE
16 years 4 months ago
2007
IEEE
This paper presents a novel spatio-temporal Markov random field (MRF) for video denoising. Two main issues are addressed in this paper, namely, the estimation of noise model and t...