Sciweavers

1806 search results - page 289 / 362
» Randomness and halting probabilities
Sort
View
ICALP
2010
Springer
15 years 5 months ago
How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange)
Gossip protocols, also known as epidemic dissemination schemes, are becoming increasingly popular in distributed systems. Yet, it has remained a partially open question to determin...
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Mort...
IDA
2010
Springer
15 years 5 months ago
A Framework for Path-Oriented Network Simplification
Abstract. We propose a generic framework and methods for simplification of large networks. The methods can be used to improve the understandability of a given network, to complemen...
Hannu Toivonen, Sébastien Mahler, Fang Zhou
CONEXT
2008
ACM
15 years 5 months ago
High performance traffic shaping for DDoS mitigation
Distributed Denial of Service (DDoS) attack mitigation systems usually generate a list of filter rules in order to block malicious traffic. In contrast to this binary decision we ...
Markus Goldstein, Matthias Reif, Armin Stahl, Thom...
ECOOP
2008
Springer
15 years 5 months ago
Online Phase-Adaptive Data Layout Selection
Good data layouts improve cache and TLB performance of object-oriented software, but unfortunately, selecting an optimal data layout a priori is NP-hard. This paper introduces layo...
Chengliang Zhang, Martin Hirzel
150
Voted
BNCOD
2007
236views Database» more  BNCOD 2007»
15 years 5 months ago
Wordrank: A Method for Ranking Web Pages Based on Content Similarity
This paper presents WordRank, a new page ranking system, which exploits similarity between interconnected pages. WordRank introduces the model of the ‘biased surfer’ which is ...
Apostolos Kritikopoulos, Martha Sideri, Iraklis Va...