Sciweavers

90 search results - page 5 / 18
» Probabilistic Ranking Queries on Gaussians
Sort
View
ICDE
2009
IEEE
214views Database» more  ICDE 2009»
14 years 9 months ago
Ranking with Uncertain Scores
Large databases with uncertain information are becoming more common in many applications including data integration, location tracking, and Web search. In these applications, ranki...
Mohamed A. Soliman, Ihab F. Ilyas
MDM
2009
Springer
116views Communications» more  MDM 2009»
14 years 1 months ago
Finding Probabilistic Nearest Neighbors for Query Objects with Imprecise Locations
—A nearest neighbor query is an important notion in spatial databases and moving object databases. In the emerging application fields of moving object technologies, such as mobi...
Yuichi Iijima, Yoshiharu Ishikawa
WISE
2007
Springer
14 years 1 months ago
Optimization of Bounded Continuous Search Queries Based on Ranking Distributions
A common search problem in the World Wide Web concerns finding information if it is not known when the sources of information appear and how long sources will be available on the ...
Dirk Kukulenz, Nils Hoeller, Sven Groppe, Volker L...
ICDE
2007
IEEE
137views Database» more  ICDE 2007»
14 years 8 months ago
ProVeR: Probabilistic Video Retrieval using the Gauss-Tree
Modeling objects by probability density functions (pdf) is a new powerful method to represent complex objects in databases. By representing an object as a pdf, e.g. a Gaussian, it...
Alexey Pryakhin, Christian Böhm, Matthias Sch...
SSDBM
2008
IEEE
107views Database» more  SSDBM 2008»
14 years 1 months ago
ProUD: Probabilistic Ranking in Uncertain Databases
There are a lot of application domains, e.g. sensor databases, traffic management or recognition systems, where objects have to be compared based on vague and uncertain data. Feat...
Thomas Bernecker, Hans-Peter Kriegel, Matthias Ren...