Sciweavers

1327 search results - page 113 / 266
» Path following algorithm for the graph matching problem
Sort
View
SPAA
2005
ACM
15 years 7 months ago
Oblivious routing on geometric networks
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
Costas Busch, Malik Magdon-Ismail, Jing Xi
PUK
2003
15 years 3 months ago
Accelerating Heuristic Search in Spatial Domains
This paper exploits the spatial representation of state space problem graphs to preprocess and enhance heuristic search engines. It combines classical AI exploration with computati...
Stefan Edelkamp, Shahid Jabbar, Thomas Willhalm
CVPR
2011
IEEE
14 years 10 months ago
Hyper-graph Matching via Reweighted Random Walks
Establishing correspondences between two feature sets is a fundamental issue in computer vision, pattern recognition, and machine learning. This problem can be well formulated as g...
Jungmin Lee (Seoul National University), Minsu Cho...
ECCV
2004
Springer
15 years 7 months ago
CT from an Unmodified Standard Fluoroscopy Machine Using a Non-reproducible Path
3D reconstruction from image data is required in many medical procedures. Recently, the use of fluoroscopy data to generate these 3D models has been explored. Most existing methods...
Chris Baker, Christian Debrunner, Mohamed Mahfouz,...
ICFP
2008
ACM
16 years 1 months ago
Write it recursively: a generic framework for optimal path queries
Optimal path queries are queries to obtain an optimal path specified by a given criterion of optimality. There have been many studies to give efficient algorithms for classes of o...
Akimasa Morihata, Kiminori Matsuzaki, Masato Takei...