Sciweavers

12194 search results - page 64 / 2439
» Numberings Optimal for Learning
Sort
View
83
Voted
AAAI
2007
15 years 2 months ago
Learning and Inference for Hierarchically Split PCFGs
Treebank parsing can be seen as the search for an optimally refined grammar consistent with a coarse training treebank. We describe a method in which a minimal grammar is hierarc...
Slav Petrov, Dan Klein
106
Voted
ICML
2005
IEEE
16 years 1 months ago
Robust one-class clustering using hybrid global and local search
Unsupervised learning methods often involve summarizing the data using a small number of parameters. In certain domains, only a small subset of the available data is relevant for ...
Gunjan Gupta, Joydeep Ghosh
100
Voted
MOC
2000
132views more  MOC 2000»
15 years 10 days ago
Lattice computations for random numbers
We improve on a lattice algorithm of Tezuka for the computation of the k-distribution of a class of random number generators based on finite fields. We show how this is applied to ...
Raymond Couture, Pierre L'Ecuyer
110
Voted
CVPR
2007
IEEE
16 years 2 months ago
Towards Scalable Representations of Object Categories: Learning a Hierarchy of Parts
This paper proposes a novel approach to constructing a hierarchical representation of visual input that aims to enable recognition and detection of a large number of object catego...
Sanja Fidler, Ales Leonardis
86
Voted
ICDM
2008
IEEE
160views Data Mining» more  ICDM 2008»
15 years 7 months ago
Direct Zero-Norm Optimization for Feature Selection
Zero-norm, defined as the number of non-zero elements in a vector, is an ideal quantity for feature selection. However, minimization of zero-norm is generally regarded as a combi...
Kaizhu Huang, Irwin King, Michael R. Lyu