763 search results - page 111 / 153 » Engineering Shortest Path Algorithms |
195
click to vote
TAPAS
2011
14 years 9 months ago
2011
Every human likes choices. But today’s fast route planning algorithms usually compute just a single route between source and target. There are beginnings to compute alternative r...
119
click to vote
EMNLP
2011
14 years 1 months ago
2011
This paper compares several translation representations for a synchronous context-free grammar parse including CFGs/hypergraphs, finite-state automata (FSA), and pushdown automat...
127
click to vote
INFOCOM
2007
IEEE
15 years 8 months ago
2007
IEEE
—We study the problem of landmark selection for landmark-based routing in a network of fixed wireless communication nodes. We present a distributed landmark selection algorithm ...
108
click to vote
CVPR
2005
IEEE
16 years 4 months ago
2005
IEEE
We propose using the inner-distance between landmark points to build shape descriptors. The inner-distance is defined as the length of the shortest path between landmark points wi...
124
click to vote
ICPR
2002
IEEE
16 years 3 months ago
2002
IEEE
Humans are articulated objects composed of non-rigid parts. We are interested in detecting and tracking human motions over various periods of time. In this paper we describe a met...