Sciweavers

2878 search results - page 127 / 576
» Learning the Common Structure of Data
Sort
View
135
Voted
IOPADS
1996
87views more  IOPADS 1996»
15 years 5 months ago
Structured Permuting in Place on Parallel Disk Systems
The ability to perform permutations of large data sets in place reduces the amount of necessary available disk storage. The simplest way to perform a permutation often is to read ...
Leonard F. Wisniewski
132
Voted
JMLR
2010
139views more  JMLR 2010»
14 years 10 months ago
Causal learning without DAGs
Causal learning methods are often evaluated in terms of their ability to discover a true underlying directed acyclic graph (DAG) structure. However, in general the true structure ...
David Duvenaud, Daniel Eaton, Kevin P. Murphy, Mar...
138
Voted
MLDM
1999
Springer
15 years 8 months ago
Non-hierarchical Clustering with Rival Penalized Competitive Learning for Information Retrieval
In large content-based image database applications, e cient information retrieval depends heavily on good indexing structures of the extracted features. While indexing techniques f...
Irwin King, Tak-Kan Lau
123
Voted
PAMI
2008
176views more  PAMI 2008»
15 years 3 months ago
Learning Flexible Features for Conditional Random Fields
Abstract-- Extending traditional models for discriminative labeling of structured data to include higher-order structure in the labels results in an undesirable exponential increas...
Liam Stewart, Xuming He, Richard S. Zemel
146
Voted
ICPR
2010
IEEE
15 years 3 months ago
Detection of Salient Image Points Using Principal Subspace Manifold Structure
—This paper presents a method to find salient image points in images with regular patterns based on deviations from the overall manifold structure. The two main contributions ar...
António R. C. Paiva, Tolga Tasdizen