Sciweavers

423 search results - page 52 / 85
» Topology for Distributed Inference on Graphs
Sort
View
ICPR
2006
IEEE
16 years 29 days ago
A Unified Formulation of Invariant Point Pattern Matching
We present a unified framework for modeling and solving invariant point pattern matching problems. Invariant features are encoded as potentials in a probabilistic graphical model....
Terry Caelli, Tibério S. Caetano
TIT
2010
170views Education» more  TIT 2010»
14 years 6 months ago
Belief propagation estimation of protein and domain interactions using the sum-product algorithm
We present a novel framework to estimate protein-protein (PPI) and domain-domain (DDI) interactions based on a belief propagation estimation method that efficiently computes inter...
Faruck Morcos, Marcin Sikora, Mark S. Alber, Dale ...
ICDCS
2008
IEEE
15 years 6 months ago
On the Longest RNG Edge of Wireless Ad Hoc Networks
— Relative neighborhood graph (RNG) has been widely used in topology control and geographic routing in wireless ad hoc networks. Its maximum edge length is the minimum requiremen...
Peng-Jun Wan, Lixin Wang, F. Frances Yao, Chih-Wei...
SIAMDM
2011
14 years 6 months ago
Stable Roommates Matchings, Mirror Posets, Median Graphs, and the Local/Global Median Phenomenon in Stable Matchings
For stable marriage (SM) and solvable stable roommates (SR) instances, it is known that there are stable matchings that assign each participant to his or her (lower/upper) median ...
Christine T. Cheng, Anhua Lin
EDBT
2006
ACM
159views Database» more  EDBT 2006»
16 years 40 min ago
Fast Nearest Neighbor Search on Road Networks
Nearest neighbor (NN) queries have been extended from Euclidean spaces to road networks. Existing approaches are either based on Dijkstra-like network expansion or NN/distance prec...
Haibo Hu, Dik Lun Lee, Jianliang Xu