388 search results - page 5 / 78 » An approximate algorithm for median graph computation using ... |
NIPS
2003
13 years 9 months ago
2003
This paper addresses the problem of untangling hidden graphs from a set of noisy detections of undirected edges. We present a model of the generation of the observed graph that in...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
This paper considers the problem of performing decentralised coordination of low-power embedded devices (as is required within many environmental sensing and surveillance applicat...
DSD
2010
IEEE
13 years 8 months ago
2010
IEEE
—This paper presents an approximate Maximum Common Subgraph (MCS) algorithm, specifically for directed, cyclic graphs representing digital circuits. Because of the application d...
SDM
2007
SIAM
13 years 9 months ago
2007
SIAM
Nonlinear dimensionality reduction methods often rely on the nearest-neighbors graph to extract low-dimensional embeddings that reliably capture the underlying structure of high-d...