552 search results - page 78 / 111 » Constrained Shortest Path Computation |
CORR
2011
Springer
14 years 4 months ago
2011
Springer
We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants. T...
76
Voted
CHI
2002
ACM
15 years 10 months ago
2002
ACM
The lodestones and leylines interaction technique simplifies navigation in electronic spaces by coordinating physical and conceptual movementgently constraining motion to follow a...
ICCV
2007
IEEE
15 years 11 months ago
2007
IEEE
We present the first method to compute depth cues from images taken solely under uncalibrated near point lighting. A stationary scene is illuminated by a point source that is move...
WAOA
2005
Springer
15 years 3 months ago
2005
Springer
We study computational and coordination efficiency issues of Nash equilibria in symmetric network congestion games. We first propose a simple and natural greedy method that comput...
115
click to vote
PODC
2006
ACM
15 years 3 months ago
2006
ACM
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...