77 search results - page 6 / 16 » AS Path Inference by Exploiting Known AS Paths |
101
Voted
ICCV
2009
IEEE
16 years 4 months ago
2009
IEEE
In structure-from-motion with a single camera it is well
known that the scene can be only recovered up to a scale. In
order to compute the absolute scale, one needs to know the
...
106
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
This paper develops upper bounds on the end-to-end transmission capacity of multi-hop wireless networks. Potential source-destination paths are dynamically selected from a pool of...
EUROPAR
2010
Springer
15 years 21 days ago
2010
Springer
Manual parallelization of programs is known to be difficult and error-prone, and there are currently few ways to measure the amount of potential parallelism in the original sequent...
102
Voted
ENGL
2007
14 years 11 months ago
2007
Abstract—In any formal theory, a proof is a sequence of well formed formulas (wff). Here, we consider the digraph whose nodes are proofs and the edges are pairs of proofs such t...
110
click to vote
INFOCOM
1999
IEEE
15 years 3 months ago
1999
IEEE
Abstract--We explore the use of end-to-end multicast traffic as measurement probes to infer network-internal characteristics. We have developed in an earlier paper [2] a Maximum Li...