Sciweavers

Share
14 search results - page 1 / 3
» A Novel Probabilistic Pruning Approach to Speed Up Similarit...
Sort
View
CORR
2011
Springer
175views Education» more  CORR 2011»
11 years 1 months ago
A Novel Probabilistic Pruning Approach to Speed Up Similarity Queries in Uncertain Databases
Abstract— In this paper, we propose a novel, effective and efficient probabilistic pruning criterion for probabilistic similarity queries on uncertain data. Our approach support...
Thomas Bernecker, Tobias Emrich, Hans-Peter Kriege...
EDBT
2008
ACM
180views Database» more  EDBT 2008»
12 years 6 months ago
Probabilistic ranked queries in uncertain databases
Recently, many new applications, such as sensor data monitoring and mobile device tracking, raise up the issue of uncertain data management. Compared to "certain" data, ...
Xiang Lian, Lei Chen 0002
TKDE
2010
274views more  TKDE 2010»
11 years 5 months ago
Ranked Query Processing in Uncertain Databases
—Recently, many new applications, such as sensor data monitoring and mobile device tracking, raise up the issue of uncertain data management. Compared to “certain” data, the ...
Xiang Lian, Lei Chen 0002
TKDE
2008
234views more  TKDE 2008»
11 years 6 months ago
Probabilistic Group Nearest Neighbor Queries in Uncertain Databases
The importance of query processing over uncertain data has recently arisen due to its wide usage in many real-world applications. In the context of uncertain databases, previous wo...
Xiang Lian, Lei Chen 0002
EDBT
2009
ACM
173views Database» more  EDBT 2009»
11 years 11 months ago
PROUD: a probabilistic approach to processing similarity queries over uncertain data streams
We present PROUD - A PRObabilistic approach to processing similarity queries over Uncertain Data streams, where the data streams here are mainly time series streams. In contrast t...
Mi-Yen Yeh, Kun-Lung Wu, Philip S. Yu, Ming-Syan C...
books