Sciweavers

3256 search results - page 94 / 652
» Learning Linear Transformations
Sort
View
CSL
2007
Springer
14 years 3 months ago
From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
Dale Miller, Alexis Saurin
ICC
2007
IEEE
121views Communications» more  ICC 2007»
14 years 3 months ago
On the Expected Complexity Analysis of a Generalized Sphere Decoding Algorithm for Underdetermined Linear Communication Systems
This paper presents an analytical approach to evaluate the expected complexity of a generalized sphere decoding (GSD) algorithm, GSDλ − , for underdetermined integer leastsquare...
Ping Wang, Tho Le-Ngoc
EUROGP
2008
Springer
105views Optimization» more  EUROGP 2008»
13 years 10 months ago
A Linear Estimation-of-Distribution GP System
We present N-gram GP, an estimation of distribution algorithm for the evolution of linear computer programs. The algorithm learns and samples the joint probability distribution of...
Riccardo Poli, Nicholas Freitag McPhee
CICLING
2010
Springer
14 years 9 days ago
Adaptive Term Weighting through Stochastic Optimization
Term weighting strongly influences the performance of text mining and information retrieval approaches. Usually term weights are determined through statistical estimates based on s...
Michael Granitzer
ICPR
2008
IEEE
14 years 3 months ago
Transductive optimal component analysis
We propose a new transductive learning algorithm for learning optimal linear representations that utilizes unlabeled data. We pose the problem of learning linear representations a...
Yuhua Zhu, Yiming Wu, Xiuwen Liu, Washington Mio