Sciweavers

3378 search results - page 484 / 676
» Learning in Friedberg Numberings
Sort
View
KDD
2009
ACM
191views Data Mining» more  KDD 2009»
16 years 7 months ago
Scalable pseudo-likelihood estimation in hybrid random fields
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...
Antonino Freno, Edmondo Trentin, Marco Gori
CVPR
2009
IEEE
17 years 1 months ago
Efficient Kernels for Identifying Unbounded-Order Spatial Features
Higher order spatial features, such as doublets or triplets have been used to incorporate spatial information into the bag-of-local-features model. Due to computational limits, ...
Yimeng Zhang (Carnegie Mellon University), Tsuhan ...
ICCV
2003
IEEE
16 years 8 months ago
Fast Pose Estimation with Parameter-Sensitive Hashing
Example-based methods are effective for parameter estimation problems when the underlying system is simple or the dimensionality of the input is low. For complex and high-dimensio...
Gregory Shakhnarovich, Paul A. Viola, Trevor Darre...
ICCV
1999
IEEE
16 years 8 months ago
Finding People by Sampling
We show how to use a sampling method to find sparsely clad people in static images. People are modeled as an assembly of nine cylindrical segments. Segments are found using an EM ...
Sergey Ioffe, David A. Forsyth
ICIP
2005
IEEE
16 years 8 months ago
Feature selection with nonparametric statistics
In this paper we discuss a general framework for feature selection based on nonparametric statistics. The three stage approach we propose is based on the assumption that the avail...
Emanuele Franceschi, Francesca Odone, Fabrizio Sme...