214 search results - page 23 / 43 » A measure of similarity between graph vertices |
COMPGEOM
2004
ACM
14 years 25 days ago
2004
ACM
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...
AIPS
2010
13 years 8 months ago
2010
Efficient management and propagation of temporal constraints is important for temporal planning as well as for scheduling. During plan development, new events and temporal constra...
ICML
2003
IEEE
14 years 8 months ago
2003
IEEE
An approach to semi-supervised learning is proposed that is based on a Gaussian random field model. Labeled and unlabeled data are represented as vertices in a weighted graph, wit...
IBIS
2006
13 years 7 months ago
2006
: Schema matching is the task of finding semantic correspondences between elements of two schemas, which plays a key role in many database applications. In this paper, we cast the ...
WADS
2007
Springer
14 years 1 months ago
2007
Springer
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...