1871 search results - page 74 / 375 » The Ephemeral Pairing Problem |
ICC
2007
IEEE
15 years 5 months ago
2007
IEEE
— Assume the reliability of a connection is determined by the number of distinct risks associated with the path. We study the most reliable routing for WDM networks with arbitrar...
WWW
2007
ACM
15 years 12 months ago
2007
ACM
Finding relationships between entities on the Web, e.g., the connections between different places or the commonalities of people, is a novel and challenging problem. Existing Web ...
ECCC
2006
14 years 11 months ago
2006
Given a graph G and a collection of source-sink pairs in G, what is the least integer c such that each source can be connected by a path to its sink, with at most c paths going th...
104
click to vote
ALGORITHMICA
2011
14 years 6 months ago
2011
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...
COMPGEOM
2006
ACM
15 years 5 months ago
2006
ACM
Persistent homology is the mathematical core of recent work on shape, including reconstruction, recognition, and matching. Its pertinent information is encapsulated by a pairing o...