3678 search results - page 243 / 736 » On the Stable Paths Problem |
128
click to vote
ICNP
2002
IEEE
15 years 10 months ago
2002
IEEE
The TCP transport layer protocol is designed for connections that traverse a single path between the sender and receiver. However, there are several environments in which multiple...
157
Voted
CIAC
1997
Springer
15 years 9 months ago
1997
Springer
In this paper, we study the Graph Isomorphism problem on graphs of bounded treewidth, bounded degree or bounded bandwidth. Graph Isomorphism can be solved in polynomial time for g...
142
click to vote
COMPGEOM
1994
ACM
15 years 9 months ago
1994
ACM
We consider the problem of a robot which has to find a target in an unknown simple polygon, based only on what it has seen so far. A street is a polygon for which the two boundary...
136
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
In this paper, motivated by network inference and tomography applications, we study the problem of compressive sensing for sparse signal vectors over graphs. In particular, we are ...
163
Voted
SIGMETRICS
2005
ACM
15 years 10 months ago
2005
ACM
Network service providers and customers are often concerned with aggregate performance measures that span multiple network paths. Unfortunately, forming such network-wide measures ...