Sciweavers

2421 search results - page 131 / 485
» Measuring independence of datasets
Sort
View
CVPR
2008
IEEE
16 years 8 months ago
Learning and using taxonomies for fast visual categorization
The computational complexity of current visual categorization algorithms scales linearly at best with the number of categories. The goal of classifying simultaneously Ncat = 104 -...
Gregory Griffin, Darya Perona
ICDE
1997
IEEE
130views Database» more  ICDE 1997»
16 years 7 months ago
High-Dimensional Similarity Joins
Many emerging data mining applications require a similarity join between points in a high-dimensional domain. We present a new algorithm that utilizes a new index structure, calle...
Kyuseok Shim, Ramakrishnan Srikant, Rakesh Agrawal
MICCAI
2003
Springer
16 years 7 months ago
Exploratory Identification of Cardiac Noise in fMRI Images
A fast exploratory framework for extracting cardiac noise signals contained in rest-case fMRI images is presented. Highly autocorrelated, independent components of the input time ...
Lilla Zöllei, Lawrence P. Panych, W. Eric L. ...
ICML
2005
IEEE
16 years 7 months ago
Recognition and reproduction of gestures using a probabilistic framework combining PCA, ICA and HMM
This paper explores the issue of recognizing, generalizing and reproducing arbitrary gestures. We aim at extracting a representation that encapsulates only the key aspects of the ...
Sylvain Calinon, Aude Billard
ICML
2005
IEEE
16 years 7 months ago
Naive Bayes models for probability estimation
Naive Bayes models have been widely used for clustering and classification. However, they are seldom used for general probabilistic learning and inference (i.e., for estimating an...
Daniel Lowd, Pedro Domingos