695 search results - page 64 / 139 » Convex Learning with Invariances |
COMBINATORICA
2010
13 years 6 months ago
2010
A d-dimensional polycube is a facet-connected set of cubes in d dimensions. Fixed polycubes are considered distinct if they differ in their shape or orientation. A proper d-dimens...
SDM
2008
SIAM
13 years 10 months ago
2008
SIAM
RELIEF is considered one of the most successful algorithms for assessing the quality of features due to its simplicity and effectiveness. It has been recently proved that RELIEF i...
NIPS
2007
13 years 10 months ago
2007
We present a novel linear clustering framework (DIFFRAC) which relies on a linear discriminative cost function and a convex relaxation of a combinatorial optimization problem. The...
AADA
2011
12 years 9 months ago
2011
We introduce a variational approach to image segmentation based on sparse coverings of image domains by shape templates. The objective function combines a data term that achieves ...
ICPR
2008
IEEE
14 years 10 months ago
2008
IEEE
The classification performance of nearest prototype classifiers largely relies on the prototype learning algorithms, such as the learning vector quantization (LVQ) and the minimum...