Sciweavers

3051 search results - page 290 / 611
» Learning Internal Representations
Sort
View
156
Voted
IJON
2008
116views more  IJON 2008»
15 years 4 months ago
Discovering speech phones using convolutive non-negative matrix factorisation with a sparseness constraint
Discovering a representation that allows auditory data to be parsimoniously represented is useful for many machine learning and signal processing tasks. Such a representation can ...
Paul D. O'Grady, Barak A. Pearlmutter
ALGORITHMICA
2005
76views more  ALGORITHMICA 2005»
15 years 4 months ago
Characterizing History Independent Data Structures
We consider history independent data structures as proposed for study by Naor and Teague [3]. In a history independent data structure, nothing can be learned from the memory repre...
Jason D. Hartline, Edwin S. Hong, Alexander E. Moh...
ISBI
2011
IEEE
14 years 8 months ago
Sparse Riemannian manifold clustering for HARDI segmentation
We address the problem of segmenting high angular resolution diffusion images of the brain into cerebral regions corresponding to distinct white matter fiber bundles. We cast thi...
Hasan Ertan Çetingül, René Vida...
CVPR
2012
IEEE
13 years 7 months ago
Pose pooling kernels for sub-category recognition
The ability to normalize pose based on super-category landmarks can significantly improve models of individual categories when training data are limited. Previous methods have co...
Ning Zhang, Ryan Farrell, Trevor Darrell
RECOMB
2003
Springer
16 years 5 months ago
Modeling dependencies in protein-DNA binding sites
The availability of whole genome sequences and high-throughput genomic assays opens the door for in silico analysis of transcription regulation. This includes methods for discover...
Yoseph Barash, Gal Elidan, Nir Friedman, Tommy Kap...