1399 search results - page 52 / 280 » Multi-party Finite Computations |
NIPS
2004
13 years 11 months ago
2004
We describe methods for computing an implicit model of a hypersurface that is given only by a finite sampling. The methods work by mapping the sample points into a reproducing ker...
IJFCS
2006
13 years 10 months ago
2006
We study some structural and combinatorial properties of Sturmian palindromes, i.e., palindromic finite factors of Sturmian words. In particular, we give a formula which permits t...
JSC
2010
13 years 4 months ago
2010
The linear complete differential resultant of a finite set of linear ordinary differential polynomials is defined. We study the computation by linear complete differential resulta...
ICALP
1998
Springer
14 years 2 months ago
1998
Springer
Abstract. We consider systems of finite automata performing together computation on an input string. Each automaton has its own read head that moves independently of the other head...
IPPS
1996
IEEE
14 years 2 months ago
1996
IEEE
In this paper, we present a parallel algorithm for the minimization of deterministic finite state automata (DFA's) and discuss its implementation on a connection machine CM-5...