Sciweavers

438 search results - page 62 / 88
» A Theory of Competitive Analysis for Distributed Algorithms
Sort
View
ICDCSW
2008
IEEE
14 years 1 months ago
Understanding the Tolerance of Dynamic Networks: A Routing-Oriented Approach
Research on delay tolerant networks (DTNs) has brought about a plethora of routing algorithms targeted at networks with different mobility patterns. However, few research works ha...
Yifeng Shao, Jie Wu
IPPS
2008
IEEE
14 years 1 months ago
On performance bottleneck of anonymous communication networks
Although a significant amount of effort has been directed at discovering attacks against anonymity communication networks and developing countermeasures to those attacks, there i...
Ryan Pries, Wei Yu, Steve Graham, Xinwen Fu
DAC
2006
ACM
14 years 8 months ago
Statistical timing based on incomplete probabilistic descriptions of parameter uncertainty
Existing approaches to timing analysis under uncertainty are based on restrictive assumptions. Statistical STA techniques assume that the full probabilistic distribution of parame...
Wei-Shen Wang, Vladik Kreinovich, Michael Orshansk...
SIGMETRICS
2012
ACM
257views Hardware» more  SIGMETRICS 2012»
11 years 9 months ago
Fair sampling across network flow measurements
Sampling is crucial for controlling resource consumption by internet traffic flow measurements. Routers use Packet Sampled NetFlow [9], and completed flow records are sampled in...
Nick G. Duffield
KDD
2008
ACM
150views Data Mining» more  KDD 2008»
14 years 7 months ago
Hypergraph spectral learning for multi-label classification
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...
Liang Sun, Shuiwang Ji, Jieping Ye