Sciweavers

116 search results - page 10 / 24
» Testing Euclidean Spanners
Sort
View
GECCO
2005
Springer
143views Optimization» more  GECCO 2005»
14 years 2 months ago
Solving geometric TSP with ants
This paper presents an ant-based approach for solving the Traveling Salesman Problem (TSP). Novel concepts of this algorithm that distinguish it from the other heuristics are the ...
Thang Nguyen Bui, Mufit Colpan
CVPR
2012
IEEE
11 years 11 months ago
Group action induced distances for averaging and clustering Linear Dynamical Systems with applications to the analysis of dynami
We introduce a framework for defining a distance on the (non-Euclidean) space of Linear Dynamical Systems (LDSs). The proposed distance is induced by the action of the group of o...
Bijan Afsari, Rizwan Chaudhry, Avinash Ravichandra...
ICASSP
2007
IEEE
14 years 2 months ago
Breaking the Limitation of Manifold Analysis for Super-Resolution of Facial Images
A novel method for robust super-resolution offace images is proposed in this paper. Face super-resolution is a particular interest in video surveillance where face images have typ...
Sung Won Park, Marios Savvides
WACV
2005
IEEE
14 years 2 months ago
Gait Verification Using Probabilistic Methods
In this paper we describe a novel method for gait based identity verification based on Bayesian classification. The verification task is reduced to a two class problem (Client or ...
Alex I. Bazin, Mark S. Nixon
ATAL
2010
Springer
13 years 9 months ago
Strategy generation in multi-agent imperfect-information pursuit games
We describe a formalism and algorithms for game-tree search in partially-observable Euclidean space, and implementation and tests in a scenario where a multi-agent team, called tr...
Eric Raboin, Dana S. Nau, Ugur Kuter, Satyandra K....