492 search results - page 51 / 99 » Perfect Matching Preservers |
130
click to vote
DMTCS
2010
14 years 9 months ago
2010
A geometric graph is a graph G = (V, E) drawn in the plane, such that V is a point set in general position and E is a set of straight-line segments whose endpoints belong to V . W...
CORR
2011
Springer
14 years 7 months ago
2011
Springer
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...
121
click to vote
CPHYSICS
2011
14 years 3 months ago
2011
In the presented article we present an algorithm for the computation of ground state spin configurations for the 2d random bond Ising model on planar triangular lattice graphs. T...
160
click to vote
SIGMOD
2008
ACM
16 years 1 days ago
2008
ACM
A primary challenge to large-scale data integration is creating semantic equivalences between elements from different data sources that correspond to the same real-world entity or...
111
click to vote
MKWI
2008
15 years 1 months ago
2008
: Matchmaking between offers and requests is an essential mechanism in electronic market places. Description Logics have been proposed as a appropriate framework for representing o...