1007 search results - page 57 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
120
click to vote
ICML
2005
IEEE
16 years 3 months ago
2005
IEEE
Hidden Markov Models (HMMs) model sequential data in many fields such as text/speech processing and biosignal analysis. Active learning algorithms learn faster and/or better by cl...
134
Voted
CIKM
2005
Springer
15 years 8 months ago
2005
Springer
In this paper, we propose a new strategy for optimizing the placement of bin boundaries to minimize the cost of query evaluation using bitmap indices with binning. For attributes ...
157
Voted
IS
2011
14 years 9 months ago
2011
In order to process continuous queries over Wireless Sensor Networks (WSNs), sensors are typically organized in a Query Routing Tree (denoted as T) that provides each sensor with ...
209
click to vote
SIGMOD
2007
ACM
16 years 2 months ago
2007
ACM
Managing uncertain data using probabilistic frameworks has attracted much interest lately in the database literature, and a central computational challenge is probabilistic infere...
118
click to vote
MOBIDE
2005
ACM
15 years 8 months ago
2005
ACM
This work addresses the problem of efficient maintenance of the (correct) answers to the continuous spatio-temporal range queries in Moving Objects Databases (MOD), which represen...