Sciweavers

1728 search results - page 173 / 346
» The Accelerated Euclidean Algorithm
Sort
View
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
16 years 17 days ago
Geometric particle swarm optimisation on binary and real spaces: from theory to practice
Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of traditional particle swarm optimization (PSO) that applies naturally to both continu...
Cecilia Di Chio, Alberto Moraglio, Riccardo Poli
INFOCOM
2006
IEEE
16 years 13 days ago
Locating Sensors in Concave Areas
Abstract— In sensor network localization, multihop based approaches were proposed to approximate the shortest paths to Euclidean distances between pairwise sensors. A good approx...
Chen Wang, Li Xiao
WACV
2005
IEEE
16 years 1 hour ago
A Factorization Method for Structure from Planar Motion
We propose a factorization method for structure from planar motion using a stationary perspective camera. Compared with [8] for general motion, our work has three major difference...
Jian Li, Rama Chellappa
ECML
2005
Springer
15 years 12 months ago
Fitting the Smallest Enclosing Bregman Ball
Finding a point which minimizes the maximal distortion with respect to a dataset is an important estimation problem that has recently received growing attentions in machine learnin...
Richard Nock, Frank Nielsen
SIGMOD
2004
ACM
150views Database» more  SIGMOD 2004»
15 years 12 months ago
Clustering Objects on a Spatial Network
Clustering is one of the most important analysis tasks in spatial databases. We study the problem of clustering objects, which lie on edges of a large weighted spatial network. Th...
Man Lung Yiu, Nikos Mamoulis