83 search results - page 8 / 17 » Two techniques for fast computation of constrained shortest ... |
GIS
2002
ACM
13 years 7 months ago
2002
ACM
A very important class of queries in GIS applications is the class of K-Nearest Neighbor queries. Most of the current studies on the K-Nearest Neighbor queries utilize spatial ind...
28
Voted
EMMCVPR
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We introduce a novel implicit approach for single object segmentation in 3D images. The boundary surface of this object is assumed to contain two known curves (the constr...
ESA
2008
Springer
13 years 9 months ago
2008
Springer
In recent years, many speed-up techniques for Dijkstra's algorithm have been developed that make the computation of shortest paths in static road networks a matter of microse...
ICCV
2005
IEEE
14 years 1 months ago
2005
IEEE
The space of images is known to be a non-linear subspace that is difficult to model. This paper derives an algorithm that walks within this space. We seek a manifold through the ...
STACS
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. Block codes are first viewed as finite state automata represented as trellises. A technique termed subtrellis overlaying is introduced with the object of reducing decoder...