Sciweavers

1279 search results - page 75 / 256
» Fast Implementations of Automata Computations
Sort
View
SIAMSC
2011
113views more  SIAMSC 2011»
13 years 2 months ago
An Efficient Higher-Order Fast Multipole Boundary Element Solution for Poisson-Boltzmann-Based Molecular Electrostatics
In order to compute polarization energy of biomolecules, we describe a boundary element approach to solving the linearized Poisson–Boltzmann equation. Our approach combines sever...
Chandrajit L. Bajaj, Shun-Chuan Albert Chen, Alexa...
RECOMB
2003
Springer
14 years 8 months ago
Designing seeds for similarity search in genomic DNA
Large-scale comparison of genomic DNA is of fundamental importance in annotating functional elements of genomes. To perform large comparisons efficiently, BLAST (Methods: Companio...
Jeremy Buhler, Uri Keich, Yanni Sun
STRINGOLOGY
2008
13 years 9 months ago
Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian Words
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...
Pawel Baturo, Marcin Piatkowski, Wojciech Rytter
FLOPS
2008
Springer
13 years 9 months ago
Certified Exact Real Arithmetic Using Co-induction in Arbitrary Integer Base
In this paper we describe some certified algorithms for exact real arithmetic based on co-recursion. Our work is based on previous experiences using redundant digits of base 2 but ...
Nicolas Julien
ICCAD
2006
IEEE
131views Hardware» more  ICCAD 2006»
14 years 4 months ago
Fast wire length estimation by net bundling for block placement
The wire length estimation is the bottleneck of packing based block placers. To cope with this problem, we present a fast wire length estimation method in this paper. The key idea...
Tan Yan, Hiroshi Murata