Sciweavers

1756 search results - page 226 / 352
» Directed scale-free graphs
Sort
View
139
Voted
IVC
2008
223views more  IVC 2008»
15 years 22 days ago
Euclidean path modeling for video surveillance
In this paper, we address the issue of Euclidean path modeling in a single camera for activity monitoring in a multi-camera video surveillance system. The method consists of a pat...
Imran N. Junejo, Hassan Foroosh
JSAC
2008
98views more  JSAC 2008»
15 years 22 days ago
Randomized consensus algorithms over large scale networks
Suppose we have a directed graph G with set of nodes V = {1, . . . , N} and a measure xi for every node i V . The average consensus problem consists in computing the average xA = ...
Fabio Fagnani, Sandro Zampieri
77
Voted
SIAMDM
2008
77views more  SIAMDM 2008»
15 years 20 days ago
The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra
The Windy Postman Problem consists of finding a minimum cost traversal of all the edges of an undirected graph with two costs associated with each edge, representing the costs of ...
Angel Corberán, Isaac Plana, José M....
88
Voted
TVCG
2008
140views more  TVCG 2008»
15 years 19 days ago
Efficient Morse Decompositions of Vector Fields
Vector field analysis plays a crucial role in many engineering applications, such as weather prediction, tsunami and hurricane study, and airplane and automotive design. Existing ...
Guoning Chen, Konstantin Mischaikow, Robert S. Lar...
95
Voted
MST
2002
152views more  MST 2002»
15 years 12 days ago
Average-Case Analysis of Greedy Packet Scheduling
We study the average number of delays suffered by packets routed using greedy (work conserving) scheduling policies. We obtain tight bounds on the worst-case average number of del...
Zvi Lotker, Boaz Patt-Shamir