Sciweavers

16430 search results - page 510 / 3286
» On Computable Tree Functions
Sort
View
BMCBI
2010
142views more  BMCBI 2010»
15 years 7 months ago
pplacer: linear time maximum-likelihood and Bayesian phylogenetic placement of sequences onto a fixed reference tree
Background: Likelihood-based phylogenetic inference is generally considered to be the most reliable classification method for unknown sequences. However, traditional likelihood-ba...
Frederick A. Matsen III, Robin B. Kodner, E. Virgi...
COGSCI
2004
148views more  COGSCI 2004»
15 years 6 months ago
Disfluencies, language comprehension, and Tree Adjoining Grammars
Disfluencies include editing terms such as uh and um as well as repeats and revisions. Little is known about how disfluencies are processed, and there has been next to no research...
Fernanda Ferreira, Ellen F. Lau, Karl G. D. Bailey
ACNS
2010
Springer
189views Cryptology» more  ACNS 2010»
15 years 12 months ago
High Performance GHASH Function for Long Messages
Abstract. This work presents a new method to compute the GHASH function involved in the Galois/Counter Mode of operation for block ciphers. If X = X1 . . . Xn is a bit string made ...
Nicolas Meloni, Christophe Nègre, M. Anwar ...
184
Voted
IFL
1997
Springer
153views Formal Methods» more  IFL 1997»
15 years 11 months ago
Common Subexpressions Are Uncommon in Lazy Functional Languages
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...
Olaf Chitil
CVPR
2008
IEEE
15 years 8 months ago
Probabilistic multi-tensor estimation using the Tensor Distribution Function
Diffusion weighted magnetic resonance (MR) imaging is a powerful tool that can be employed to study white matter microstructure by examining the 3D displacement profile of water m...
Alex D. Leow, Siwei Zhu, Katie McMahon, Greig I. d...