1414 search results - page 14 / 283 » Randomness and Universal Machines |
LPAR
2005
Springer
14 years 2 months ago
2005
Springer
ECKING ABSTRACT STATE MACHINES WITH ANSWER SET PROGRAMMING by Calvin Kai Fan Tang B.Sc., Simon Fraser University, 2003 a thesis submitted in partial fulfillment of the requirements...
BIOADIT
2004
Springer
14 years 10 days ago
2004
Springer
After defining a Universe for computer science in opposition to the Universe of biology, this paper presents the roles that cellular division plays in both of them. Based on the ni...
SODA
2012
ACM
11 years 11 months ago
2012
ACM
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...
SACRYPT
1998
Springer
14 years 24 days ago
1998
Springer
Maurer's universal test is a very common randomness test, capable of detecting a wide gamut of statistical defects. The algorithm is simple (a few Java code lines), flexible (...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
When information is to be transmitted over an unknown, possibly unreliable channel, an erasure option at the decoder is desirable. Using constant-composition random codes, we propo...