Sciweavers

724 search results - page 102 / 145
» Practical Performance of Efficient Minimum Cut Algorithms
Sort
View
PODC
2009
ACM
16 years 3 months ago
Fast distributed random walks
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
Atish Das Sarma, Danupon Nanongkai, Gopal Panduran...
BROADNETS
2006
IEEE
15 years 9 months ago
Graded Channel Reservation with Path Switching in Ultra High Capacity Networks
— We introduce a new algorithmic framework for advanced channel reservation in ultra high speed networks, called Graded Channel Reservation (GCR). GCR allows users to specify min...
Reuven Cohen, Niloofar Fazlollahi, David Starobins...
ICASSP
2010
IEEE
15 years 3 months ago
Distributed bearing estimation via matrix completion
We consider bearing estimation of multiple narrow-band plane waves impinging on an array of sensors. For this problem, bearing estimation algorithms such as minimum variance disto...
Andrew Waters, Volkan Cevher
TROB
2008
105views more  TROB 2008»
15 years 2 months ago
Robot-to-Robot Relative Pose Estimation From Range Measurements
In this paper, we address the problem of determining the 2D relative pose of pairs of communicating robots from (i) robot-to-robot distance measurements and (ii) displacement estim...
Xun S. Zhou, Stergios I. Roumeliotis
SIGMETRICS
2002
ACM
103views Hardware» more  SIGMETRICS 2002»
15 years 2 months ago
Network tomography on general topologies
In this paper we consider the problem of inferring link-level loss rates from end-to-end multicast measurements taken from a collection of trees. We give conditions under which lo...
Tian Bu, Nick G. Duffield, Francesco Lo Presti, Do...