Sciweavers

14 search results - page 2 / 3
» A Novel Probabilistic Pruning Approach to Speed Up Similarit...
Sort
View
ICDE
2006
IEEE
194views Database» more  ICDE 2006»
14 years 8 months ago
The Gauss-Tree: Efficient Object Identification in Databases of Probabilistic Feature Vectors
In applications of biometric databases the typical task is to identify individuals according to features which are not exactly known. Reasons for this inexactness are varying meas...
Alexey Pryakhin, Christian Böhm, Matthias Sch...
SSDBM
2006
IEEE
122views Database» more  SSDBM 2006»
14 years 1 months ago
Probabilistic Ranking Queries on Gaussians
In many modern applications, there are no exact values available to describe the data objects. Instead, the feature values are considered to be uncertain. This uncertainty is mode...
Christian Böhm, Alexey Pryakhin, Matthias Sch...
DASFAA
2005
IEEE
191views Database» more  DASFAA 2005»
14 years 1 months ago
An Efficient Approach to Extracting Approximate Repeating Patterns in Music Databases
Pattern extraction from music strings is an important problem. The patterns extracted from music strings can be used as features for music retrieval or analysis. Previous works on ...
Ning-Han Liu, Yi-Hung Wu, Arbee L. P. Chen
SIGMOD
2012
ACM
212views Database» more  SIGMOD 2012»
11 years 10 months ago
Local structure and determinism in probabilistic databases
While extensive work has been done on evaluating queries over tuple-independent probabilistic databases, query evaluation over correlated data has received much less attention eve...
Theodoros Rekatsinas, Amol Deshpande, Lise Getoor
PVLDB
2010
89views more  PVLDB 2010»
13 years 5 months ago
Transforming Range Queries To Equivalent Box Queries To Optimize Page Access
Range queries based on L1 distance are a common type of queries in multimedia databases containing feature vectors. We propose a novel approach that transforms the feature space i...
Sakti Pramanik, Alok Watve, Chad R. Meiners, Alex ...