458 search results - page 39 / 92 » Distance graphs: from random geometric graphs to Bernoulli g... |
CVPR
2009
IEEE
15 years 3 months ago
2009
IEEE
Interactive image segmentation traditionally involves the
use of algorithms such as Graph Cuts or Random Walker.
Common concerns with using Graph Cuts are metrication
artifacts ...
ICML
2010
IEEE
13 years 9 months ago
2010
IEEE
Learning temporal causal graph structures from multivariate time-series data reveals important dependency relationships between current observations and histories, and provides a ...
WINET
2010
13 years 7 months ago
2010
We study routing algorithms for three-dimensional ad hoc networks that guarantee delivery and are k-local, i.e., each intermediate node v’s routing decision only depends on knowl...
ECUMN
2007
Springer
14 years 2 months ago
2007
Springer
This article presents a novel method for computing distances between hosts in a computational Grid. Our method allows to represent the cost to achieve any operation involving some...
WG
2004
Springer
14 years 2 months ago
2004
Springer
The Phylogenetic kth Root Problem (PRk) is the problem of finding a (phylogenetic) tree T from a given graph G = (V, E) such that (1) T has no degree-2 internal nodes, (2) the ex...