257 search results - page 44 / 52 » An Approximate L1-Difference Algorithm for Massive Data Stre... |
75
Voted
CIDR
2007
14 years 11 months ago
2007
In this paper, we investigate the benefits and challenges of integrating history into a near-real-time monitoring system; and present a general purpose continuous monitoring engi...
105
Voted
EDBT
2008
ACM
15 years 9 months ago
2008
ACM
Sharing huge, massively distributed databases in P2P systems is inherently difficult. As the amount of stored data increases, data localization techniques become no longer suffici...
ICML
2003
IEEE
15 years 10 months ago
2003
IEEE
In this paper we present a simple to implement truly online large margin version of the Perceptron ranking (PRank) algorithm, called the OAP-BPM (Online Aggregate Prank-Bayes Poin...
TPDS
2008
14 years 9 months ago
2008
Peer-to-peer (P2P) systems have become a popular platform for sharing and exchanging voluminous information among thousands or even millions of users. The massive amount of inform...
ADC
2010
Springer
14 years 4 months ago
2010
Springer
Aggregation against distinct objects has been involved in many real applications with the presence of duplicates, including real-time monitoring moving objects. In this paper, we ...