5115 search results - page 134 / 1023 » On Randomized Lanczos Algorithms |
122
click to vote
ICPR
2008
IEEE
16 years 24 days ago
2008
IEEE
This paper presents a novel two-phase stereo matching algorithm using the random walks framework. At first, a set of reliable matching pixels is extracted with prior matrices de...
180
click to vote
APPROX
2008
Springer
15 years 8 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...
167
click to vote
ICML
2010
IEEE
15 years 7 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...
171
click to vote
JDA
2008
15 years 6 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...
143
click to vote
ESA
1995
Springer
15 years 10 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...