552 search results - page 31 / 111 » Constrained Shortest Path Computation |
109
Voted
ICCV
2007
IEEE
15 years 6 months ago
2007
IEEE
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...
94
Voted
ICCSA
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...
193
Voted
SIGMOD
2009
ACM
16 years 21 days ago
2009
ACM
This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new quer...
81
Voted
LCN
2006
IEEE
15 years 6 months ago
2006
IEEE
Today’s intra-domain protocols are limited in their scalability. We examine these limitations and propose an alternative in the form of an IGP based on path vectors. Taking adva...
90
Voted
DAC
2004
ACM
15 years 6 months ago
2004
ACM
As the technology migrates into the deep submicron manufacturing (DSM) era, the critical dimension of the circuits is getting smaller than the lithographic wavelength. The unavoid...