401 search results - page 48 / 81 » Sparse Quasi-Random Graphs |
ACCV
2006
Springer
14 years 1 months ago
2006
Springer
In this paper, we propose a new stereo matching algorithm using an iterated graph cuts and mean shift filtering technique. Our algorithm consists of following two steps. In the ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Designing and implementing efficient, provably correct parallel machine learning (ML) algorithms is challenging. Existing high-level parallel abstractions like MapReduce are insuf...
JMLR
2006
13 years 7 months ago
2006
We present Variable Influence Structure Analysis, or VISA, an algorithm that performs hierarchical decomposition of factored Markov decision processes. VISA uses a dynamic Bayesia...
ECCV
2008
Springer
14 years 9 months ago
2008
Springer
We propose a graph-based semi-supervised symmetric matching framework that performs dense matching between two uncalibrated wide-baseline images by exploiting the results of sparse...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
This paper describes a low-complexity approach for reconstructing average packet arrival rates and instantaneous packet counts at a router in a communication network, where the arr...