10146 search results - page 167 / 2030 » Fast FAST |
160
click to vote
FMSD
2002
15 years 6 months ago
2002
The powerlists data structure, created by Misra in the early 90s, is well suited to express recursive, data-parallel algorithms. Misra has shown how powerlists can be used to give ...
166
click to vote
JUCS
2002
15 years 6 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 ...
155
click to vote
MOC
1998
15 years 6 months ago
1998
We show that the multiple zeta sum: ζ(s1, s2, ..., sd) = n1>n2>...>nd 1 ns1 1 ns2 2 ...n sd d , for positive integers si with s1 > 1, can always be written as a finit...
182
click to vote
NAR
2007
15 years 6 months ago
2007
INFO-RNA is a new web server for designing RNA sequences that fold into a user given secondary structure. Furthermore, constraints on the sequence can be specified, e.g. one can r...
171
click to vote
FIMH
2007
Springer
16 years 20 days ago
2007
Springer
Based on discrete mathematical morphology, we propose a new automated and fast procedure to segment the left ventricular myocardium in 4D (3D+t) cine-MRI sequences. Thanks to the c...