1414 search results - page 94 / 283 » Randomness and Universal Machines |
CISC
2006
Springer
14 years 1 months ago
2006
Springer
Buffer overflow(BOF) has been the most common form of vulnerability in software systems today, and many methods exist to defend software systems against BOF attacks. Among them, th...
WWW
2010
ACM
14 years 5 months ago
2010
ACM
PageRank computes the importance of each node in a directed graph under a random surfer model governed by a teleportation parameter. Commonly denoted alpha, this parameter models ...
DAGM
2004
Springer
14 years 3 months ago
2004
Springer
We consider the general problem of learning from labeled and unlabeled data. Given a set of points, some of them are labeled, and the remaining points are unlabeled. The goal is to...
COLT
2003
Springer
14 years 3 months ago
2003
Springer
A mere bounded number of random bits judiciously employed by a probabilistically correct algorithmic coordinator is shown to increase the power of learning to coordinate compared ...
CP
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...