Sciweavers

7351 search results - page 315 / 1471
» Segmenting Point Sets
Sort
View
BSL
2011
15 years 1 months ago
Combinatorial dichotomies in set theory
show that an abstract analysis of one of these three set theoretic principles can sometimes lead us to results that do not require additional axioms at all but which could have bee...
Stevo Todorcevic
166
Voted
GECCO
2010
Springer
187views Optimization» more  GECCO 2010»
15 years 11 months ago
The maximum hypervolume set yields near-optimal approximation
In order to allow a comparison of (otherwise incomparable) sets, many evolutionary multiobjective optimizers use indicator functions to guide the search and to evaluate the perfor...
Karl Bringmann, Tobias Friedrich
PR
2006
87views more  PR 2006»
15 years 6 months ago
Prototype reduction schemes applicable for non-stationary data sets
All of the prototype reduction schemes (PRS) which have been reported in the literature, process time-invariant data to yield a subset of prototypes that are useful in nearest-nei...
Sang-Woon Kim, B. John Oommen
KDD
2002
ACM
155views Data Mining» more  KDD 2002»
16 years 7 months ago
SyMP: an efficient clustering approach to identify clusters of arbitrary shapes in large data sets
We propose a new clustering algorithm, called SyMP, which is based on synchronization of pulse-coupled oscillators. SyMP represents each data point by an Integrate-and-Fire oscill...
Hichem Frigui
JC
2008
128views more  JC 2008»
15 years 6 months ago
Lattice rule algorithms for multivariate approximation in the average case setting
We study multivariate approximation for continuous functions in the average case setting. The space of d variate continuous functions is equipped with the zero mean Gaussian measu...
Frances Y. Kuo, Ian H. Sloan, Henryk Wozniakowski