Sciweavers

364 search results - page 56 / 73
» Shortest-path network interdiction
Sort
View
PVLDB
2010
152views more  PVLDB 2010»
13 years 6 months ago
k-Nearest Neighbors in Uncertain Graphs
Complex networks, such as biological, social, and communication networks, often entail uncertainty, and thus, can be modeled as probabilistic graphs. Similar to the problem of sim...
Michalis Potamias, Francesco Bonchi, Aristides Gio...

Lecture Notes
443views
15 years 5 months ago
Design and Analysis of Computer Algorithms
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
David M. Mount
STOC
2004
ACM
110views Algorithms» more  STOC 2004»
14 years 8 months ago
On sums of independent random variables with unbounded variance, and estimating the average degree in a graph
We prove the following inequality: for every positive integer n and every collection X1, . . . , Xn of nonnegative independent random variables that each has expectation 1, the pr...
Uriel Feige
INFOCOM
2009
IEEE
14 years 2 months ago
Tracking with Unreliable Node Sequences
—Tracking mobile targets using sensor networks is a challenging task because of the impacts of in-the-filed factors such as environment noise, sensing irregularity and etc. This...
Ziguo Zhong, Ting Zhu, Dan Wang, Tian He
PRDC
2007
IEEE
14 years 1 months ago
Implementation of Highly Available OSPF Router on ATCA
This paper proposes a Highly-Available Open Shortest Path First (HA-OSPF) router which consists of two OSPF router modules-active and standby-to support a highavailability network...
Chia-Tai Tsai, Rong-Hong Jan, Chien Chen, Chia-Yua...