785 search results - page 66 / 157 » Efficient Processing of Top-k Queries in Uncertain Databases |
ICDT
2010
ACM
14 years 6 months ago
2010
ACM
Sources of data uncertainty and imprecision are numerous. A way to handle this uncertainty is to associate probabilistic annotations to data. Many such probabilistic database mode...
KDD
1998
ACM
14 years 1 months ago
1998
ACM
For a wide variety of classification algorithms, scalability to large databases can be achieved by observing that most algorithms are driven by a set of sufficient statistics that...
ICDE
2009
IEEE
14 years 10 months ago
2009
IEEE
Discovering non-trivial matching subsequences from two time series is very useful in synthesizing novel time series. This can be applied to applications such as motion synthesis wh...
ICDE
2008
IEEE
14 years 10 months ago
2008
IEEE
In this paper, we address the problem of extending a relational database system to facilitate efficient real-time application of dynamic probabilistic models to streaming data. he ...
EDBT
2009
ACM
14 years 23 days ago
2009
ACM
In order to become an effective complement to traditional Web-scale text-based image retrieval solutions, content-based image retrieval must address scalability and efficiency iss...