Sciweavers

458 search results - page 18 / 92
» Fast and Simple Relational Processing of Uncertain Data
Sort
View
PAMI
2010
164views more  PAMI 2010»
13 years 6 months ago
Large-Scale Discovery of Spatially Related Images
— We propose a randomized data mining method that finds clusters of spatially overlapping images. The core of the method relies on the min-Hash algorithm for fast detection of p...
Ondrej Chum, Jiri Matas
ICML
2008
IEEE
14 years 8 months ago
The dynamic hierarchical Dirichlet process
The dynamic hierarchical Dirichlet process (dHDP) is developed to model the timeevolving statistical properties of sequential data sets. The data collected at any time point are r...
Lu Ren, David B. Dunson, Lawrence Carin
ICASSP
2011
IEEE
12 years 11 months ago
Fast adaptive variational sparse Bayesian learning with automatic relevance determination
In this work a new adaptive fast variational sparse Bayesian learning (V-SBL) algorithm is proposed that is a variational counterpart of the fast marginal likelihood maximization ...
Dmitriy Shutin, Thomas Buchgraber, Sanjeev R. Kulk...
ICASSP
2011
IEEE
12 years 11 months ago
Audio Signal Representations for Factorization in the Sparse Domain
In this paper, a new class of audio representations is introduced, together with a corresponding fast decomposition algorithm. The main feature of these representations is that th...
Manuel Moussallam, Laurent Daudet, Gaël Richa...
SIGMOD
2005
ACM
107views Database» more  SIGMOD 2005»
14 years 7 months ago
Relational Confidence Bounds Are Easy With The Bootstrap
Statistical estimation and approximate query processing have become increasingly prevalent applications for database systems. However, approximation is usually of little use witho...
Abhijit Pol, Chris Jermaine