Sciweavers

1778 search results - page 208 / 356
» The Theory of Probabilistic Databases
Sort
View
SSDBM
2010
IEEE
188views Database» more  SSDBM 2010»
15 years 9 months ago
Similarity Estimation Using Bayes Ensembles
Similarity search and data mining often rely on distance or similarity functions in order to provide meaningful results and semantically meaningful patterns. However, standard dist...
Tobias Emrich, Franz Graf, Hans-Peter Kriegel, Mat...
IDEAS
2000
IEEE
96views Database» more  IDEAS 2000»
15 years 9 months ago
A Cost Function for Uniformly Partitioned UB-Trees
Most operations of the relational algebra or SQL - like projection with duplicate elimination, join, ordering, group by and aggregations - are efficiently processed using a sorted...
Volker Markl, Rudolf Bayer
PODS
1998
ACM
152views Database» more  PODS 1998»
15 years 9 months ago
A Cost Model for Similarity Queries in Metric Spaces
We consider the problem of estimating CPU (distance computations) and I/O costs for processing range and k-nearest neighbors queries over metric spaces. Unlike the specific case ...
Paolo Ciaccia, Marco Patella, Pavel Zezula
ADC
2009
Springer
151views Database» more  ADC 2009»
15 years 8 months ago
Unified Q-ary Tree for RFID Tag Anti-Collision Resolution
Radio Frequency Identification (RFID) technology uses radio-frequency waves to automatically identify people or objects. A large volume of data, resulting from the fast capturing ...
Prapassara Pupunwiwat, Bela Stantic
FLAIRS
2001
15 years 6 months ago
A Method for Evaluating Elicitation Schemes for Probabilities
We present an objective approach for evaluating probability elicitation methods in probabilistic models. Our method draws on ideas from research on learning Bayesian networks: if ...
Haiqin Wang, Denver Dash, Marek J. Druzdzel