Sciweavers

2092 search results - page 165 / 419
» A Theory of Non-Deterministic Networks
Sort
View
BMCBI
2007
129views more  BMCBI 2007»
15 years 13 days ago
Integrated network reconstruction, visualization and analysis using YANAsquare
Background: Modeling of metabolic networks includes tasks such as network assembly, network overview, calculation of metabolic fluxes and testing the robustness of the network. Re...
Roland Schwarz, Chunguang Liang, Christoph Kaleta,...
CCR
2010
184views more  CCR 2010»
15 years 13 days ago
Characterising temporal distance and reachability in mobile and online social networks
The analysis of social and technological networks has attracted a lot of attention as social networking applications and mobile sensing devices have given us a wealth of real data...
John Tang, Mirco Musolesi, Cecilia Mascolo, Vito L...
PODC
2009
ACM
16 years 26 days ago
Brief announcement: collaborative measurement of upload speeds in P2P systems
We define and study the bandwidth determination problem in adhoc P2P environments. Using point-to-point bandwidth probes, the goal is to quickly determine each host's upload ...
John R. Douceur, James W. Mickens, Thomas Moscibro...
88
Voted
STOC
2005
ACM
167views Algorithms» more  STOC 2005»
16 years 19 days ago
Approximately counting integral flows and cell-bounded contingency tables
We consider the problem of approximately counting integral flows in a network. We show that there is an fpras based on volume estimation if all capacities are sufficiently large, ...
Mary Cryan, Martin E. Dyer, Dana Randall
PODS
2006
ACM
217views Database» more  PODS 2006»
16 years 13 days ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
Lap-Kei Lee, H. F. Ting