Sciweavers

374 search results - page 10 / 75
» Fast separable factorization and applications
Sort
View
ISSAC
2004
Springer
135views Mathematics» more  ISSAC 2004»
14 years 27 days ago
The truncated fourier transform and applications
In this paper, we present a truncated version of the classical Fast Fourier Transform. When applied to polynomial multiplication, this algorithm has the nice property of eliminati...
Joris van der Hoeven
CORR
2010
Springer
179views Education» more  CORR 2010»
13 years 5 months ago
The DMM bound: multivariate (aggregate) separation bounds
In this paper we derive aggregate separation bounds, named after Davenport-MahlerMignotte (DMM), on the isolated roots of polynomial systems, specifically on the minimum distance ...
Ioannis Z. Emiris, Bernard Mourrain, Elias P. Tsig...
IJON
2007
76views more  IJON 2007»
13 years 7 months ago
Modeling L-LTP based on changes in concentration of pCREB transcription factor
We simulate the induction and maintenance of late long-term potentiation (L-LTP) in the hippocampal dentate gyrus by means of a new synaptic plasticity rule that is the result of ...
Lubica Benuskova, Nikola Kasabov
SIGMOD
2011
ACM
193views Database» more  SIGMOD 2011»
12 years 10 months ago
Fast checkpoint recovery algorithms for frequently consistent applications
Advances in hardware have enabled many long-running applications to execute entirely in main memory. As a result, these applications have increasingly turned to database technique...
Tuan Cao, Marcos Antonio Vaz Salles, Benjamin Sowe...
BMCBI
2010
86views more  BMCBI 2010»
13 years 7 months ago
Fast motif recognition via application of statistical thresholds
Background: Improving the accuracy and efficiency of motif recognition is an important computational challenge that has application to detecting transcription factor binding sites...
Christina Boucher, James King