8196 search results - page 268 / 1640 » Computational Modeling and Complexity Science |
184
click to vote
JCST
2010
15 years 1 months ago
2010
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
183
click to vote
JFP
2000
15 years 6 months ago
2000
Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the suc...
158
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
Knockout tournaments constitute a common format of sporting events, and also model a specific type of election scheme (namely, sequential pairwise elimination election). In such ...
136
click to vote
ACL
2010
15 years 4 months ago
2010
We report on an experiment to track complex decision points in linguistic metadata annotation where the decision behavior of annotators is observed with an eyetracking device. As ...
141
click to vote
CRYPTO
2007
Springer
16 years 23 days ago
2007
Springer
We initiate a complexity-theoretic treatment of hardness amplification for collision-resistant hash functions, namely the transformation of weakly collision-resistant hash functio...