57 search results - page 6 / 12 » Evaluating very large datalog queries on social networks |
INFOCOM
2005
IEEE
15 years 3 months ago
2005
IEEE
— Estimation of network proximity among nodes is an important building block in several applications like service selection and composition, multicast tree formation, and overlay...
106
click to vote
KDD
2007
ACM
15 years 10 months ago
2007
ACM
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
DEXA
2005
Springer
15 years 3 months ago
2005
Springer
Computing aggregates over distributed data sets constitutes an interesting class of distributed queries. Recent advances in peer-to-peer discovery of data sources and query process...
108
Voted
SIGMETRICS
2010
ACM
14 years 8 months ago
2010
ACM
Many network-management problems in large backbone networks need the answer to a seemingly simple question: where does a given IP packet, entering the network at a particular plac...
DASFAA
2006
IEEE
15 years 3 months ago
2006
IEEE
Abstract. As networks continue to grow in size and complexity, distributed network monitoring and resource querying are becoming increasingly difficult. Our aim is to design, build...