Sciweavers

619 search results - page 30 / 124
» Random Bichromatic Matchings
Sort
View
FLAIRS
2004
13 years 10 months ago
ABSURDIST II: A Graph Matching Algorithm and its Application to Conceptual System Translation
ABSURDIST II, an extension to ABSURDIST, is an algorithm using attributed graph matching to find translations between conceptual systems. It uses information about the internal st...
Ying Feng, Robert L. Goldstone, Vladimir Menkov
CVIU
2007
154views more  CVIU 2007»
13 years 8 months ago
Bayesian stereo matching
A Bayesian framework is proposed for stereo vision where solutions to both the model parameters and the disparity map are posed in terms of predictions of latent variables, given ...
Li Cheng, Terry Caelli
PVLDB
2010
200views more  PVLDB 2010»
13 years 7 months ago
SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs
With the emergence of new applications, e.g., computational biology, new software engineering techniques, social networks, etc., more data is in the form of graphs. Locating occur...
Shijie Zhang, Jiong Yang, Wei Jin
GLOBECOM
2008
IEEE
14 years 3 months ago
Impact of Random Mobility on the Inhomogeneity of Spatial Distributions
Abstract—Simulation results of wireless networks heavily depend on the spatial distribution of its nodes. Even though the initial distribution may match the expectations of the r...
Michael Gyarmati, Udo Schilcher, Günther Bran...
ACL
2008
13 years 10 months ago
Generalized Expectation Criteria for Semi-Supervised Learning of Conditional Random Fields
This paper presents a semi-supervised training method for linear-chain conditional random fields that makes use of labeled features rather than labeled instances. This is accompli...
Gideon S. Mann, Andrew McCallum