Sciweavers

699 search results - page 81 / 140
» Generalized Distance Functions in the Theory of Computation
Sort
View
GECCO
2008
Springer
124views Optimization» more  GECCO 2008»
14 years 11 months ago
Runtime analysis of binary PSO
We investigate the runtime of the Binary Particle Swarm Optimization (PSO) algorithm introduced by Kennedy and Eberhart (1997). The Binary PSO maintains a global best solution and...
Dirk Sudholt, Carsten Witt
CVPR
2004
IEEE
15 years 11 months ago
2D-Shape Analysis Using Conformal Mapping
The study of 2D shapes and their similarities is a central problem in the field of vision. It arises in particular from the task of classifying and recognizing objects from their ...
Eitan Sharon, David Mumford
KDD
2008
ACM
224views Data Mining» more  KDD 2008»
15 years 10 months ago
The structure of information pathways in a social communication network
Social networks are of interest to researchers in part because they are thought to mediate the flow of information in communities and organizations. Here we study the temporal dyn...
Gueorgi Kossinets, Jon M. Kleinberg, Duncan J. Wat...
KDD
2006
ACM
122views Data Mining» more  KDD 2006»
15 years 10 months ago
Measuring and extracting proximity in networks
Measuring distance or some other form of proximity between objects is a standard data mining tool. Connection subgraphs were recently proposed as a way to demonstrate proximity be...
Yehuda Koren, Stephen C. North, Chris Volinsky
STOC
2004
ACM
126views Algorithms» more  STOC 2004»
15 years 10 months ago
Bypassing the embedding: algorithms for low dimensional metrics
The doubling dimension of a metric is the smallest k such that any ball of radius 2r can be covered using 2k balls of raThis concept for abstract metrics has been proposed as a na...
Kunal Talwar