Sciweavers

1512 search results - page 267 / 303
» Inference Algorithms for Similarity Networks
Sort
View
TON
2002
109views more  TON 2002»
14 years 9 months ago
Coordinated multihop scheduling: a framework for end-to-end services
In multi-hop networks, packet schedulers at downstream nodes have an opportunity to make up for excessive latencies due to congestion at upstream nodes. Similarly, when packets inc...
Chengzhi Li, Edward W. Knightly
INFOCOM
2010
IEEE
14 years 8 months ago
PeopleRank: Social Opportunistic Forwarding
— In opportunistic networks, end-to-end paths between two communicating nodes are rarely available. In such situations, the nodes might still copy and forward messages to nodes t...
Abderrahmen Mtibaa, Martin May, Christophe Diot, M...
SRDS
2010
IEEE
14 years 7 months ago
Invariants Based Failure Diagnosis in Distributed Computing Systems
This paper presents an instance based approach to diagnosing failures in computing systems. Owing to the fact that a large portion of occurred failures are repeated ones, our meth...
Haifeng Chen, Guofei Jiang, Kenji Yoshihira, Akhil...
TSE
2010
230views more  TSE 2010»
14 years 4 months ago
Vulnerability Discovery with Attack Injection
The increasing reliance put on networked computer systems demands higher levels of dependability. This is even more relevant as new threats and forms of attack are constantly being...
João Antunes, Nuno Ferreira Neves, Miguel C...
ICALP
2011
Springer
14 years 1 months ago
Content Search through Comparisons
We study the problem of navigating through a database of similar objects using comparisons. This problem is known to be strongly related to the small-world network design problem....
Amin Karbasi, Stratis Ioannidis, Laurent Massouli&...