Sciweavers

321 search results - page 44 / 65
» Approximate Models for General Cache Networks
Sort
View
CCR
2006
110views more  CCR 2006»
13 years 8 months ago
On the feasibility of commercial, legal P2P content distribution
A spirited panel was recently held at the 10th International Web Caching and Content Distribution workshop on the future of P2P in content distribution [1]. After more than ten ye...
Pablo Rodriguez, See-Mong Tan, Christos Gkantsidis
CORR
2012
Springer
230views Education» more  CORR 2012»
12 years 4 months ago
Fast Triangle Counting through Wedge Sampling
Graphs and networks are used to model interactions in a variety of contexts, and there is a growing need to be able to quickly assess the qualities of a graph in order to understa...
C. Seshadhri, Ali Pinar, Tamara G. Kolda
UAI
2008
13 years 10 months ago
Observation Subset Selection as Local Compilation of Performance Profiles
Deciding what to sense is a crucial task, made harder by dependencies and by a nonadditive utility function. We develop approximation algorithms for selecting an optimal set of me...
Yan Radovilsky, Solomon Eyal Shimony
GLOBECOM
2007
IEEE
14 years 2 months ago
On the Expected Connection Lifetime and Stochastic Resilience of Wireless Multi-Hop Networks
—To understand how node mobility and Byzantine node failures affect connectivity of wireless multi-hop networks, this paper investigates resilience of geometric random graphs to ...
Fei Xing, Wenye Wang
KDD
2010
ACM
244views Data Mining» more  KDD 2010»
13 years 7 months ago
Finding effectors in social networks
Assume a network (V, E) where a subset of the nodes in V are active. We consider the problem of selecting a set of k active nodes that best explain the observed activation state, ...
Theodoros Lappas, Evimaria Terzi, Dimitrios Gunopu...