1146 search results - page 26 / 230 » Finite cupping sets |
COMBINATORICS
2006
13 years 7 months ago
2006
We give a simpler proof of the result of Boros and F
UAI
2008
13 years 9 months ago
2008
When the initial and transition probabilities of a finite Markov chain in discrete time are not well known, we should perform a sensitivity analysis. This is done by considering a...
CIE
2008
Springer
13 years 9 months ago
2008
Springer
A computable graph is computably categorical if any two computable presentations of the graph are computably isomorphic. In this paper we investigate the class of computably catego...
DBSEC
2010
13 years 9 months ago
2010
This work treats the problem of error-resilient DNA searching via oblivious evaluation of finite automata, formulated as follows: a client has a DNA sequence, and a service provid...
JUCS
2002
13 years 7 months ago
2002
: In this paper, we present a fast and simple algorithm for constructing a minimal acyclic deterministic finite automaton from a finite set of words. Such automata are useful in a ...