Sciweavers

3143 search results - page 312 / 629
» Minimization of entropy functionals
Sort
View
COLT
2008
Springer
15 years 6 months ago
An Information Theoretic Framework for Multi-view Learning
In the multi-view learning paradigm, the input variable is partitioned into two different views X1 and X2 and there is a target variable Y of interest. The underlying assumption i...
Karthik Sridharan, Sham M. Kakade
ICML
2010
IEEE
15 years 6 months ago
On the Consistency of Ranking Algorithms
We present a theoretical analysis of supervised ranking, providing necessary and sufficient conditions for the asymptotic consistency of algorithms based on minimizing a surrogate...
John Duchi, Lester W. Mackey, Michael I. Jordan
CORR
2007
Springer
173views Education» more  CORR 2007»
15 years 5 months ago
Computing modular polynomials in quasi-linear time
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...
Andreas Enge
158
Voted
SIAMSC
2010
144views more  SIAMSC 2010»
15 years 3 months ago
An Exponentially Convergent Nonpolynomial Finite Element Method for Time-Harmonic Scattering from Polygons
In recent years nonpolynomial finite element methods have received increasing attention for the efficient solution of wave problems. As with their close cousin the method of parti...
A. H. Barnett, Timo Betcke
160
Voted
LACL
2005
Springer
15 years 10 months ago
A Note on the Complexity of Constraint Interaction: Locality Conditions and Minimalist Grammars
Locality Conditions (LCs) on (unbounded) dependencies have played a major role in the development of generative syntax ever since the seminal work by Ross [22]. Descriptively, they...
Hans-Martin Gärtner, Jens Michaelis