Sciweavers

511 search results - page 79 / 103
» TSP with bounded metrics
Sort
View
STOC
2010
ACM
228views Algorithms» more  STOC 2010»
14 years 1 months ago
On the searchability of small-world networks with arbitrary underlying structure
Revisiting the “small-world” experiments of the ’60s, Kleinberg observed that individuals are very effective at constructing short chains of acquaintances between any two p...
Pierre Fraigniaud and George Giakkoupis
ICPR
2000
IEEE
14 years 9 months ago
Winner-Update Algorithm for Nearest Neighbor Search
This paper presents an algorithm, called the winnerupdate algorithm, for accelerating the nearest neighbor search. By constructing a hierarchical structure ,for each feature point...
Yong-Sheng Chen, Yi-Ping Hung, Chiou-Shann Fuh
GIS
2005
ACM
14 years 9 months ago
Improving the R*-tree with outlier handling techniques
The R*-tree, as a state-of-the-art spatial index, has already found its way into commercial systems like Oracle. In this paper, we aim at improving query performance of the R*tree...
Tian Xia, Donghui Zhang
MICCAI
2006
Springer
14 years 9 months ago
Toward Interactive User Guiding Vessel Axis Extraction from Gray-scale Angiograms: An Optimization Framework
We propose a novel trace-based method to extract vessel axes from gray-scale angiograms without preliminary segmentations. Our method traces the axes on an optimization framework w...
Wilbur C. K. Wong, Albert C. S. Chung
IPMI
2007
Springer
14 years 9 months ago
Inter and Intra-modal Deformable Registration: Continuous Deformations Meet Efficient Optimal Linear Programming
In this paper we propose a novel non-rigid volume registration based on discrete labeling and linear programming. The proposed framework reformulates registration as a minimal path...
Ben Glocker, Nikos Komodakis, Nikos Paragios, Geor...