Sciweavers

1937 search results - page 151 / 388
» Conditioning Probabilistic Databases
Sort
View
DEXAW
1999
IEEE
168views Database» more  DEXAW 1999»
15 years 3 months ago
Using the Distance Distribution for Approximate Similarity Queries in High-Dimensional Metric Spaces
We investigate the problem of approximate similarity (nearest neighbor) search in high-dimensional metric spaces, and describe how the distance distribution of the query object ca...
Paolo Ciaccia, Marco Patella
PODS
1993
ACM
122views Database» more  PODS 1993»
15 years 3 months ago
Towards an Analysis of Range Query Performance in Spatial Data Structures
In this paper, we motivate four di erent user de ned window query classes and derive a probabilistic model for each of them. For each model, we characterize the e ciency of spatia...
Bernd-Uwe Pagel, Hans-Werner Six, Heinrich Toben, ...
AI
2005
Springer
15 years 1 months ago
Incorporating Evidence in Bayesian Networks with the Select Operator
Abstract. In this paper, we propose that the select operator in relational databases be adopted for incorporating evidence in Bayesian networks. This approach does not involve the ...
Cory J. Butz, F. Fang
97
Voted
EDBT
2009
ACM
207views Database» more  EDBT 2009»
15 years 2 months ago
Evaluating probability threshold k-nearest-neighbor queries over uncertain data
In emerging applications such as location-based services, sensor monitoring and biological management systems, the values of the database items are naturally imprecise. For these ...
Reynold Cheng, Lei Chen 0002, Jinchuan Chen, Xike ...
80
Voted
NIPS
2003
15 years 12 days ago
When Does Non-Negative Matrix Factorization Give a Correct Decomposition into Parts?
We interpret non-negative matrix factorization geometrically, as the problem of finding a simplicial cone which contains a cloud of data points and which is contained in the posi...
David L. Donoho, Victoria Stodden