Sciweavers

4106 search results - page 69 / 822
» A Computational Model for Metric Spaces
Sort
View
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
14 years 2 months 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
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
14 years 8 months ago
Searching dynamic point sets in spaces with bounded doubling dimension
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
Richard Cole, Lee-Ad Gottlieb
SAC
2006
ACM
14 years 1 months ago
A scalable algorithm for high-quality clustering of web snippets
We consider the problem of partitioning, in a highly accurate and highly efficient way, a set of n documents lying in a metric space into k non-overlapping clusters. We augment th...
Filippo Geraci, Marco Pellegrini, Paolo Pisati, Fa...
ICCV
2009
IEEE
13 years 5 months ago
An algebraic model for fast corner detection
This paper revisits the classical problem of detecting interest points, popularly known as "corners," in 2D images by proposing a technique based on fitting algebraic sh...
Andrew Willis, Yunfeng Sui
PRL
2010
205views more  PRL 2010»
13 years 2 months ago
Mining outliers with faster cutoff update and space utilization
It is desirable to find unusual data objects by Ramaswamy et al's distance-based outlier definition because only a metric distance function between two objects is required. It...
Chi-Cheong Szeto, Edward Hung