Sciweavers

279 search results - page 34 / 56
» Methods for finding frequent items in data streams
Sort
View
CIKM
2006
Springer
13 years 9 months ago
Efficiently clustering transactional data with weighted coverage density
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...
Hua Yan, Keke Chen, Ling Liu
PODS
2005
ACM
131views Database» more  PODS 2005»
14 years 7 months ago
Space efficient mining of multigraph streams
The challenge of monitoring massive amounts of data generated by communication networks has led to the interest in data stream processing. We study streams of edges in massive com...
Graham Cormode, S. Muthukrishnan
FGCS
2007
92views more  FGCS 2007»
13 years 7 months ago
Optimizing Web Service messaging performance in mobile computing
— The performance and efficiency of Web Services can be greatly increased in conversational and streaming message exchanges by streaming the message exchange paradigm. In this pa...
Sangyoon Oh, Geoffrey Fox
IPPS
2008
IEEE
14 years 2 months ago
A game theoretical data replication technique for mobile ad hoc networks
Adaptive replication of data items on servers of a mobile ad hoc network can alleviate access delays. The selection of data items and servers requires solving a constrained optimi...
Samee Ullah Khan, Anthony A. Maciejewski, Howard J...
ICMCS
2006
IEEE
99views Multimedia» more  ICMCS 2006»
14 years 1 months ago
Efficient Search in P2P-based Video-on-Demand Streaming Service
— Providing video-on-demand streaming service to a large population of clients using peer-to-peer approach is drawing great interest recently. Since clients’ demands are asynch...
Huicheng Chi, Qian Zhang