11949 search results - page 85 / 2390 » Some results on (a:b)-choosability |
128
click to vote
EUROPAR
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. Security and fault-tolerance is a big issue for intensive parallel computing in pervasive environments with hardware errors or malicious acts that may alter the result. I...
126
click to vote
JSAC
2008
15 years 23 days ago
2008
Suppose we have a directed graph G with set of nodes V = {1, . . . , N} and a measure xi for every node i V . The average consensus problem consists in computing the average xA = ...
75
Voted
TAMC
2007
Springer
15 years 7 months ago
2007
Springer
We say that A ≤LR B if every B-random number is A-random. Intuitively this means that if oracle A can identify some patterns on some real γ, oracle B can also find patterns on ...
94
Voted
NN
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. In this paper we give some pedagogical explanation of those situations where the use of redundant or almost-redundant information can improve the recognition rates of pat...
83
Voted
VMCAI
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. This paper presents history-dependent scheduling, a new technique for reducing the search space in the verification of cryptographic protocols. This technique allows the...