Sciweavers

1778 search results - page 291 / 356
» The Theory of Probabilistic Databases
Sort
View
SAC
2009
ACM
15 years 4 months ago
Applying latent dirichlet allocation to group discovery in large graphs
This paper introduces LDA-G, a scalable Bayesian approach to finding latent group structures in large real-world graph data. Existing Bayesian approaches for group discovery (suc...
Keith Henderson, Tina Eliassi-Rad
IDEAS
2005
IEEE
149views Database» more  IDEAS 2005»
15 years 3 months ago
An Adaptive Multi-Objective Scheduling Selection Framework for Continuous Query Processing
Adaptive operator scheduling algorithms for continuous query processing are usually designed to serve a single performance objective, such as minimizing memory usage or maximizing...
Timothy M. Sutherland, Yali Zhu, Luping Ding, Elke...
ISMIR
2005
Springer
172views Music» more  ISMIR 2005»
15 years 3 months ago
Segmentation and Recognition of Tabla Strokes
A system that segments and labels tabla strokes from real performances is described. Performance is evaluated on a large database taken from three performers under different recor...
Parag Chordia
DBSEC
2004
108views Database» more  DBSEC 2004»
14 years 11 months ago
Why Is this User Asking so Many Questions? Explaining Sequences of Queries
A sequence of queries submitted by a database user within a short period of time may have a single, illuminating explanation. In this paper we consider sequences of single-record q...
Aybar C. Acar, Amihai Motro
PAMI
2006
132views more  PAMI 2006»
14 years 10 months ago
Rapid Object Indexing Using Locality Sensitive Hashing and Joint 3D-Signature Space Estimation
We propose a new method for rapid 3D object indexing that combines feature-based methods with coarse alignment-based matching techniques. Our approach achieves a sublinear complexi...
Bogdan Matei, Ying Shan, Harpreet S. Sawhney, Yi T...