Sciweavers

11213 search results - page 414 / 2243
» Low-contention data structures
Sort
View
ICDE
2005
IEEE
135views Database» more  ICDE 2005»
16 years 8 months ago
Finding (Recently) Frequent Items in Distributed Data Streams
We consider the problem of maintaining frequency counts for items occurring frequently in the union of multiple distributed data streams. Na?ive methods of combining approximate f...
Amit Manjhi, Vladislav Shkapenyuk, Kedar Dhamdhere...
WISE
2006
Springer
16 years 25 days ago
Efficient Filtering Query Indexing in Data Stream
Filtering queries are widely used in data stream applications. As more and more filtering queries are registered in high-speed data stream management system, the processing efficie...
Ying Wang, Shuo Bai, Jianlong Tan, Li Guo
P2P
2003
IEEE
110views Communications» more  P2P 2003»
16 years 3 days ago
Range Addressable Network: A P2P Cache Architecture for Data Ranges
Peer-to-peer computing paradigm is emerging as a scalable and robust model for sharing media objects. In this paper, we propose an architecture and describe the associated algorit...
Anshul Kothari, Divyakant Agrawal, Abhishek Gupta,...
ISI
2008
Springer
15 years 6 months ago
Data mining for social network analysis
A social network is defined as a social structure of individuals, who are related (directly or indirectly to each other) based on a common relation of interest, e.g. friendship, t...
J. Srivastava
ICML
2006
IEEE
16 years 7 months ago
Cost-sensitive learning with conditional Markov networks
There has been a recent, growing interest in classification and link prediction in structured domains. Methods such as conditional random fields and relational Markov networks sup...
Prithviraj Sen, Lise Getoor