Sciweavers

331 search results - page 38 / 67
» A Clustering Algorithm Based Absorbing Nearest Neighbors
Sort
View
ALENEX
2001
151views Algorithms» more  ALENEX 2001»
13 years 9 months ago
The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests
The purpose of this paper is to provide a preliminary report on the rst broad-based experimental comparison of modern heuristics for the asymmetric traveling salesmen problem ATSP....
Jill Cirasella, David S. Johnson, Lyle A. McGeoch,...
JCB
2002
108views more  JCB 2002»
13 years 7 months ago
Fast and Accurate Phylogeny Reconstruction Algorithms Based on the Minimum-Evolution Principle
This paper investigates the standard ordinary least-squares version 24 and the balanced version 20 of the minimum evolution principle. For the standard version, we provide a greedy...
Richard Desper, Olivier Gascuel
CVPR
2003
IEEE
14 years 9 months ago
Optimal Linear Representations of Images for Object Recognition
Although linear representations are frequently used in image analysis, their performances are seldom optimal in specific applications. This paper proposes a stochastic gradient al...
Xiuwen Liu, Anuj Srivastava, Kyle Gallivan
AVBPA
2003
Springer
100views Biometrics» more  AVBPA 2003»
14 years 26 days ago
Open World Face Recognition with Credibility and Confidence Measures
This paper describes a novel framework for the Open World face recognition problem, where one has to provide for the Reject option. Based upon algorithmic randomness and transducti...
Fayin Li, Harry Wechsler
W2GIS
2004
Springer
14 years 29 days ago
Expansion-Based Algorithms for Finding Single Pair Shortest Path on Surface
Abstract. Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path plannin...
Ke Deng, Xiaofang Zhou