Sciweavers

619 search results - page 4 / 124
» Random Bichromatic Matchings
Sort
View
ACSC
2005
IEEE
14 years 1 months ago
Large k-Separated Matchings of Random Regular Graphs
A k-separated matching in a graph is a set of edges at distance at least k from one another (hence, for instance, a 1-separated matching is just a matching in the classical sense)...
Mihalis Beis, William Duckworth, Michele Zito
CVPR
2011
IEEE
13 years 3 months ago
Global Stereo Matching Leveraged by Sparse Ground Control Points
We present a novel global stereo model that makes use of constraints from points with known depths, i.e., the Ground Control Points (GCPs) as referred to in stereo literature. Our...
Liang Wang, Ruigang Yang
CIARP
2009
Springer
13 years 5 months ago
A Computer-Assisted Colorization Approach Based on Efficient Belief Propagation and Graph Matching
Abstract. Region-based approaches have been proposed to computerassisted colorization problem, typically using shape similarity and topology relations between regions. Given a colo...
Alexandre Noma, Luiz Velho, Roberto M. Cesar
MMAS
2010
Springer
13 years 2 months ago
Source Localization in Random Acoustic Waveguides
Mode coupling due to scattering by weak random inhomogeneities in waveguides leads to loss of coherence of wave fields at long distances of propagation. This in turn leads to serio...
Liliana Borcea, Leila Issa, Chrysoula Tsogka
COLING
2010
13 years 2 months ago
FactRank: Random Walks on a Web of Facts
Fact collections are mostly built using semi-supervised relation extraction techniques and wisdom of the crowds methods, rendering them inherently noisy. In this paper, we propose...
Alpa Jain, Patrick Pantel