Sciweavers

3244 search results - page 46 / 649
» On convex complexity measures
Sort
View
76
Voted
ESANN
2007
15 years 23 days ago
Complexity bounds of radial basis functions and multi-objective learning
In the paper, the problem of multi-objective (MOBJ) learning is discussed. The problem of obtaining apparent (effective) complexity measure, which is one of the objectives, is con...
Illya Kokshenev, Antônio de Pádua Bra...
ALGORITHMICA
2004
111views more  ALGORITHMICA 2004»
14 years 11 months ago
The Hausdorff Voronoi Diagram of Point Clusters in the Plane
We study the Hausdorff Voronoi diagram of point clusters in the plane, a generalization of Voronoi diagrams based on the Hausdorff distance function. We derive a tight combinatori...
Evanthia Papadopoulou
COMPGEOM
2009
ACM
15 years 5 months ago
Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension
We describe a new implementation of the well-known incremental algorithm for constructing Delaunay triangulations in any dimension. Our implementation follows the exact computing ...
Jean-Daniel Boissonnat, Olivier Devillers, Samuel ...
ICARCV
2008
IEEE
170views Robotics» more  ICARCV 2008»
15 years 5 months ago
Mixed state estimation for a linear Gaussian Markov model
— We consider a discrete-time dynamical system with Boolean and continuous states, with the continuous state propagating linearly in the continuous and Boolean state variables, a...
Argyris Zymnis, Stephen P. Boyd, Dimitry M. Gorine...
TKDE
2008
111views more  TKDE 2008»
14 years 11 months ago
A Point Symmetry-Based Clustering Technique for Automatic Evolution of Clusters
In this paper, a new symmetry-based genetic clustering algorithm is proposed which automatically evolves the number of clusters as well as the proper partitioning from a data set. ...
Sanghamitra Bandyopadhyay, Sriparna Saha