Sciweavers

1279 search results - page 21 / 256
» Fast Implementations of Automata Computations
Sort
View
ARITH
2005
IEEE
14 years 1 months ago
A Fast-Start Method for Computing the Inverse Tangent
In a search for an algorithm to compute atan(x) which has both low latency and few floating point instructions, an interesting variant of familiar trigonometry formulas was disco...
Peter W. Markstein
ISBRA
2010
Springer
14 years 2 months ago
Fast Computation of the Exact Hybridization Number of Two Phylogenetic Trees
Abstract. Hybridization is a reticulate evolutionary process. An established problem on hybridization is computing the minimum number of hybridization events, called the hybridizat...
Yufeng Wu, Jiayin Wang
SIGPRO
2008
89views more  SIGPRO 2008»
13 years 7 months ago
Radix-2 algorithm for the fast computation of type-III 3-D discrete W transform
: In this letter, an efficient algorithm for three-dimensional (3-D) vector radix decimation in frequency is derived for computing the type-III 3-D discrete W transform (DWT). Comp...
Huazhong Shu, J. S. Wu, Lotfi Senhadji, Limin Luo
NIPS
2008
13 years 9 months ago
Fast Computation of Posterior Mode in Multi-Level Hierarchical Models
Multi-level hierarchical models provide an attractive framework for incorporating correlations induced in a response variable organized in a hierarchy. Model fitting is challengin...
Liang Zhang, Deepak Agarwal
LICS
2006
IEEE
14 years 1 months ago
Avoiding Determinization
Automata on infinite objects are extensively used in system specification, verification, and synthesis. While some applications of the automata-theoretic approach have been wel...
Orna Kupferman