1449 search results - page 73 / 290 » Self-Randomized Exponentiation Algorithms |
161
click to vote
BCS
2008
15 years 7 months ago
2008
We propose a defi nition of Cellular Automaton in which links between cells can change during the computation. This is done locally by each cell, which can reach the neighbours of...
154
click to vote
UAI
2008
15 years 7 months ago
2008
While known algorithms for sensitivity analysis and parameter tuning in probabilistic networks have a running time that is exponential in the size of the network, the exact comput...
153
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Recently, the problem of obtaining a short regular expression equivalent to a given finite automaton has been intensively investigated. Algorithms for converting finite automata to...
136
click to vote
IANDC
2008
15 years 6 months ago
2008
We present a decision procedure for the description logic SHIQ based on the basic superposition calculus, and show that it runs in exponential time for unary coding of numbers. To...
169
click to vote
CPC
2007
15 years 6 months ago
2007
We show that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. The proof uses an efficient algorithm which a.a.s. 3colours a random 4-regular ...