Sciweavers

239 search results - page 40 / 48
» Random walks in a supply network
Sort
View
MOBICOM
2004
ACM
14 years 24 days ago
Practical robust localization over large-scale 802.11 wireless networks
We demonstrate a system built using probabilistic techniques that allows for remarkably accurate localization across our entire office building using nothing more than the built-...
Andreas Haeberlen, Eliot Flannery, Andrew M. Ladd,...
WWW
2002
ACM
14 years 8 months ago
The structure of broad topics on the web
The Web graph is a giant social network whose properties have been measured and modeled extensively in recent years. Most such studies concentrate on the graph structure alone, an...
Soumen Chakrabarti, Mukul Joshi, Kunal Punera, Dav...
INFOCOM
2009
IEEE
14 years 2 months ago
Respondent-Driven Sampling for Characterizing Unstructured Overlays
—This paper presents Respondent-Driven Sampling (RDS) as a promising technique to derive unbiased estimates of node properties in unstructured overlay networks such as Gnutella. ...
Amir Hassan Rasti, Mojtaba Torkjazi, Reza Rejaie, ...
ISPDC
2007
IEEE
14 years 1 months ago
Fully Distributed Active and Passive Task Management for Grid Computing
The task management is a key point in grid applications and can highly influence their efficiency. There are many solutions that we can classify according to their centralizatio...
Alain Bui, Olivier Flauzac, Cyril Rabat
SDM
2008
SIAM
139views Data Mining» more  SDM 2008»
13 years 8 months ago
Proximity Tracking on Time-Evolving Bipartite Graphs
Given an author-conference network that evolves over time, which are the conferences that a given author is most closely related with, and how do they change over time? Large time...
Hanghang Tong, Spiros Papadimitriou, Philip S. Yu,...