2796 search results - page 126 / 560 » The coolest path problem |
147
click to vote
APPROX
2009
Springer
15 years 11 months ago
2009
Springer
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
134
Voted
ICDCSW
2005
IEEE
15 years 10 months ago
2005
IEEE
Recent researches have highlighted the importance of developing a network with distributed problem solving abilities thus enhancing reliability with equal share of network resourc...
182
click to vote
CVPR
2012
IEEE
13 years 7 months ago
2012
IEEE
A novel method is proposed for matching articulated objects in cluttered videos. The method needs only a single exemplar image of the target object. Instead of using a small set o...
149
Voted
SIGCOMM
2005
ACM
15 years 10 months ago
2005
ACM
We consider the problem of routing in a delay tolerant network (DTN) in the presence of path failures. Previous work on DTN routing has focused on using precisely known network dy...
155
Voted
ASPDAC
2006
ACM
15 years 8 months ago
2006
ACM
Due to false paths and multi-cycle paths in a circuit, using only topological delay to determine the clock period could be too conservative. In this paper, we address the timing a...