Sciweavers

3607 search results - page 20 / 722
» Learning with structured sparsity
Sort
View
ICML
2005
IEEE
14 years 8 months ago
Error bounds for correlation clustering
This paper presents a learning theoretical analysis of correlation clustering (Bansal et al., 2002). In particular, we give bounds on the error with which correlation clustering r...
Thorsten Joachims, John E. Hopcroft
NIPS
2004
13 years 9 months ago
PAC-Bayes Learning of Conjunctions and Classification of Gene-Expression Data
We propose a "soft greedy" learning algorithm for building small conjunctions of simple threshold functions, called rays, defined on single real-valued attributes. We al...
Mario Marchand, Mohak Shah
LEGE
2004
103views Education» more  LEGE 2004»
13 years 9 months ago
Structuring and merging Distributed Content
A flexible approach for structuring and merging distributed learning object is presented. At the basis of this approach there is a formal representation of a learning object, call...
Luca Stefanutti, Dietrich Albert, Cord Hockemeyer
BSN
2011
IEEE
233views Sensor Networks» more  BSN 2011»
12 years 8 months ago
Compressive Sensing of Neural Action Potentials Using a Learned Union of Supports
—Wireless neural recording systems are subject to stringent power consumption constraints to support long-term recordings and to allow for implantation inside the brain. In this ...
Zainul Charbiwala, Vaibhav Karkare, Sarah Gibson, ...
ECCV
2006
Springer
14 years 10 months ago
Controlling Sparseness in Non-negative Tensor Factorization
Non-negative tensor factorization (NTF) has recently been proposed as sparse and efficient image representation (Welling and Weber, Patt. Rec. Let., 2001). Until now, sparsity of t...
Matthias Heiler, Christoph Schnörr