5115 search results - page 496 / 1023 » On Randomized Lanczos Algorithms |
188
click to vote
ECCV
2002
Springer
16 years 8 months ago
2002
Springer
In this paper, we formulate the stereo matching problem as a Markov network consisting of three coupled Markov random fields (MRF's). These three MRF's model a smooth fie...
179
click to vote
ICML
2004
IEEE
16 years 7 months ago
2004
IEEE
The multiple-instance learning (MIL) model has been very successful in application areas such as drug discovery and content-based imageretrieval. Recently, a generalization of thi...
197
click to vote
KDD
2003
ACM
16 years 7 months ago
2003
ACM
Classification trees are widely used in the machine learning and data mining communities for modeling propositional data. Recent work has extended this basic paradigm to probabili...
145
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
If a two-player social welfare maximization problem does not admit a PTAS, we prove that any maximal-in-range truthful mechanism that runs in polynomial time cannot achieve an app...
201
click to vote
ICASSP
2009
IEEE
16 years 1 months ago
2009
IEEE
This paper analyzes the rate of convergence of greedy gossip with eavesdropping (GGE). In previous work, we proposed GGE, a fast gossip algorithm based on exploiting the broadcast...