Sciweavers

360 search results - page 41 / 72
» Distributed Network Querying with Bounded Approximate Cachin...
Sort
View
SIGMETRICS
2008
ACM
128views Hardware» more  SIGMETRICS 2008»
14 years 11 months ago
Confident estimation for multistage measurement sampling and aggregation
Measurement, collection, and interpretation of network usage data commonly involves multiple stage of sampling and aggregation. Examples include sampling packets, aggregating them...
Edith Cohen, Nick G. Duffield, Carsten Lund, Mikke...
IMC
2005
ACM
15 years 5 months ago
Should Internet Service Providers Fear Peer-Assisted Content Distribution?
Recently, peer-to-peer (P2P) networks have emerged as an attractive solution to enable large-scale content distribution without requiring major infrastructure investments. While s...
Thomas Karagiannis, Pablo Rodriguez, Konstantina P...
IPPS
2009
IEEE
15 years 6 months ago
Minimizing total busy time in parallel scheduling with application to optical networks
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...
Michele Flammini, Gianpiero Monaco, Luca Moscardel...
WCNC
2010
IEEE
15 years 3 months ago
Node Connectivity Analysis in Multi-Hop Wireless Networks
—In this paper, we study node connectivity in multi-hop wireless networks. Nodal degree of connectivity as one of the fundamental graph properties is the basis for the study of n...
Bahador Bakhshi, Siavash Khorsandi
SSD
2007
Springer
243views Database» more  SSD 2007»
15 years 5 months ago
Continuous Medoid Queries over Moving Objects
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...