Sciweavers

90 search results - page 6 / 18
» Stipple Placement using Distance in a Weighted Graph
Sort
View
ESA
2004
Springer
95views Algorithms» more  ESA 2004»
15 years 2 months ago
On Dynamic Shortest Paths Problems
We obtain the following results related to dynamic versions of the shortest-paths problem: (i) Reductions that show that the incremental and decremental singlesource shortest-paths...
Liam Roditty, Uri Zwick
ICNP
2003
IEEE
15 years 2 months ago
Distributed, Self-Stabilizing Placement of Replicated Resources in Emerging Networks
Emerging large scale distributed networking systems, such as P2P file sharing systems, sensor networks, and ad hoc wireless networks, require replication of content, functionalit...
Bong-Jun Ko, Dan Rubenstein
SPAA
2005
ACM
15 years 3 months ago
Name independent routing for growth bounded networks
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
Ittai Abraham, Dahlia Malkhi
ORL
2008
99views more  ORL 2008»
14 years 9 months ago
Some tractable instances of interval data minmax regret problems
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...
Bruno Escoffier, Jérôme Monnot, Olivi...
97
Voted
GBRPR
2009
Springer
15 years 1 months ago
Homeomorphic Alignment of Edge-Weighted Trees
Abstract. Motion capture, a currently active research area, needs estimation of the pose of the subject. This requires a match between a model and the 3D shape, constructed using a...
Benjamin Raynal, Michel Couprie, Venceslas Biri