2757 search results - page 383 / 552 » Deplump for Streaming Data |
158
click to vote
ICIP
2004
IEEE
16 years 7 months ago
2004
IEEE
To be efficient, data protection algorithms should generally exploit the properties of the media information in the transform domain. In this paper, we will advocate the use of no...
286
click to vote
ICDE
2006
IEEE
16 years 7 months ago
2006
IEEE
One important way in which sampling for approximate query processing in a database environment differs from traditional applications of sampling is that in a database, it is feasi...
189
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
Hidden Markov models assume that observations in time series data stem from some hidden process that can be compactly represented as a Markov chain. We generalize this model by as...
201
click to vote
PODS
2006
ACM
16 years 6 months ago
2006
ACM
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
155
click to vote
PERCOM
2008
ACM
16 years 5 months ago
2008
ACM
The complexity of developing and deploying context-aware pervasive-computing applications calls for distributed software infrastructures that assist applications to collect, aggre...