60 search results - page 12 / 12 » A fast algorithm for computing minimum routing cost spanning... |
ICRA
2005
IEEE
13 years 10 months ago
2005
IEEE
Abstract - This paper presents an improvement over a previous contour closure algorithm. Assuming that edge points are given as input, the proposed approach consists of two steps. ...
IPPS
2003
IEEE
13 years 10 months ago
2003
IEEE
— We consider the problem of maintaining routing paths between nodes in a dynamic network. Gafni and Bertsekas proposed a link reversal approach called the BG method that maintai...
ICALP
2005
Springer
13 years 10 months ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
FOCS
2002
IEEE
13 years 9 months ago
2002
IEEE
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...
STOC
2007
ACM
14 years 5 months ago
2007
ACM
We introduce a new, generic framework for private data analysis. The goal of private data analysis is to release aggregate information about a data set while protecting the privac...