Sciweavers

3244 search results - page 342 / 649
» On convex complexity measures
Sort
View
147
Voted
MOC
1998
92views more  MOC 1998»
15 years 6 months ago
Perturbing polynomials with all their roots on the unit circle
Given a monic real polynomial with all its roots on the unit circle, we ask to what extent one can perturb its middle coefficient and still have a polynomial with all its roots on ...
Michael J. Mossinghoff, Christopher G. Pinner, Jef...
TMM
2002
83views more  TMM 2002»
15 years 6 months ago
Systematic evaluation of logical story unit segmentation
Abstract--Although various Logical Story Unit (LSU) segmentation methods based on visual content have been presented in literature, a common ground for comparison is missing. We pr...
Jeroen Vendrig, Marcel Worring
PRL
2008
161views more  PRL 2008»
15 years 6 months ago
Automatic kernel clustering with a Multi-Elitist Particle Swarm Optimization Algorithm
This article introduces a scheme for clustering complex and linearly non-separable datasets, without any prior knowledge of the number of naturally occurring groups in the data. T...
Swagatam Das, Ajith Abraham, Amit Konar
GECCO
2010
Springer
127views Optimization» more  GECCO 2010»
15 years 5 months ago
Set-based multi-objective optimization, indicators, and deteriorative cycles
Evolutionary multi-objective optimization deals with the task of computing a minimal set of search points according to a given set of objective functions. The task has been made e...
Rudolf Berghammer, Tobias Friedrich, Frank Neumann
IJCV
2010
249views more  IJCV 2010»
15 years 5 months ago
A Computational Model of Multidimensional Shape
We develop a computational model of shape that extends existing Riemannian models of shape of curves to multidimensional objects of general topological type. We construct shape sp...
Xiuwen Liu, Yonggang Shi, Ivo D. Dinov, Washington...