Sciweavers

386 search results - page 13 / 78
» Probabilistic Ranking of Database Query Results
Sort
View
ICDE
2010
IEEE
171views Database» more  ICDE 2010»
14 years 8 months ago
Surrogate Ranking for Very Expensive Similarity Queries
1 We consider the problem of similarity search in applications where the cost of computing the similarity between two records is very expensive, and the similarity measure is not a...
Chris Jermaine, Fei Xu, Mingxi Wu, Ravi Jampani, T...
SIGMOD
2009
ACM
134views Database» more  SIGMOD 2009»
14 years 9 months ago
Keyword query cleaning using hidden Markov models
In this paper, we consider the problem of keyword query cleaning for structured databases from a probabilistic approach. Keyword query cleaning consists of rewriting the user quer...
Ken Q. Pu
SSD
2007
Springer
124views Database» more  SSD 2007»
14 years 3 months ago
Querying Objects Modeled by Arbitrary Probability Distributions
In many modern applications such as biometric identification systems, sensor networks, medical imaging, geology, and multimedia databases, the data objects are not described exact...
Christian Böhm, Peter Kunath, Alexey Pryakhin...
SIGMOD
2009
ACM
180views Database» more  SIGMOD 2009»
14 years 9 months ago
Indexing correlated probabilistic databases
With large amounts of correlated probabilistic data being generated in a wide range of application domains including sensor networks, information extraction, event detection etc.,...
Bhargav Kanagal, Amol Deshpande
DASFAA
2007
IEEE
208views Database» more  DASFAA 2007»
14 years 3 months ago
Probabilistic Nearest-Neighbor Query on Uncertain Objects
Nearest-neighbor queries are an important query type for commonly used feature databases. In many different application areas, e.g. sensor databases, location based services or fac...
Hans-Peter Kriegel, Peter Kunath, Matthias Renz