Sciweavers

6 search results - page 1 / 2
» Computing the complexity of the relation of isometry between...
Sort
View
MLQ
2007
83views more  MLQ 2007»
13 years 6 months ago
Computing the complexity of the relation of isometry between separable Banach spaces
We compute here the Borel complexity of the relation of isometry between separable Banach spaces, using results of Gao, Kechris [1] and Mayer-Wolf [4]. We show that this relation ...
Julien Melleray
JMLR
2008
117views more  JMLR 2008»
13 years 6 months ago
Active Learning by Spherical Subdivision
We introduce a computationally feasible, "constructive" active learning method for binary classification. The learning algorithm is initially formulated for separable cl...
Falk-Florian Henrich, Klaus Obermayer

Publication
141views
12 years 5 months ago
Measures of Diversity for Populations and Distances Between Individuals with Highly Reorganizable Genomes
In this paper we address the problem of defining a measure of diversity for a population of individuals whose genome can be subjected to major reorganizations during the evolution...
Claudio Mattiussi, Markus Waibel, Dario Floreano
COLT
2010
Springer
13 years 4 months ago
Toward Learning Gaussian Mixtures with Arbitrary Separation
In recent years analysis of complexity of learning Gaussian mixture models from sampled data has received significant attention in computational machine learning and theory commun...
Mikhail Belkin, Kaushik Sinha
ICCV
2003
IEEE
14 years 8 months ago
A Class of Photometric Invariants: Separating Material from Shape and Illumination
We derive a new class of photometric invariants that can be used for a variety of vision tasks including lighting invariant material segmentation, change detection and tracking, a...
Srinivasa G. Narasimhan, Visvanathan Ramesh, Shree...