Sciweavers

350 search results - page 44 / 70
» On the symmetry function of a convex set
Sort
View
ICML
2009
IEEE
15 years 12 months ago
Proximal regularization for online and batch learning
Many learning algorithms rely on the curvature (in particular, strong convexity) of regularized objective functions to provide good theoretical performance guarantees. In practice...
Chuong B. Do, Quoc V. Le, Chuan-Sheng Foo
ISBI
2002
IEEE
15 years 11 months ago
Volumetric constraints in 3D tomography applied to electron microscopy
3D Electron Microscopy aims at the reconstruction of density volumes corresponding to the mass distribution of macromolecules imaged with an electron microscope. There are many fa...
Carlos Oscar Sánchez Sorzano, Gabor T. Herm...
62
Voted
ISAAC
2005
Springer
89views Algorithms» more  ISAAC 2005»
15 years 4 months ago
Multi-source Trees: Algorithms for Minimizing Eccentricity Cost Metrics
We consider generalizations of the k-source sum of vertex eccentricity problem (k-SVET) and the k-source sum of source eccentricity problem (k-SSET) [1], which we call SDET and SSE...
Paraskevi Fragopoulou, Stavros D. Nikolopoulos, Le...
VLDB
1997
ACM
170views Database» more  VLDB 1997»
15 years 2 months ago
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
A new access method, called M-tree, is proposed to organize and search large data sets from a generic "metric space", i.e. where object proximity is only defined by a di...
Paolo Ciaccia, Marco Patella, Pavel Zezula
GECCO
2008
Springer
139views Optimization» more  GECCO 2008»
15 years 5 days ago
Coordinate change operators for genetic algorithms
This paper studies the issue of space coordinate change in genetic algorithms, based on two methods: convex quadratic approximations, and principal component analysis. In both met...
Elizabeth F. Wanner, Eduardo G. Carrano, Ricardo H...