Sciweavers

3228 search results - page 571 / 646
» Computationally Sound Proofs
Sort
View
CORR
2011
Springer
151views Education» more  CORR 2011»
14 years 6 months ago
Generating and Searching Families of FFT Algorithms
A fundamental question of longstanding theoretical interest is to prove the lowest exact count of real additions and multiplications required to compute a power-of-two discrete Fo...
Steve Haynal, Heidi Haynal
CORR
2011
Springer
193views Education» more  CORR 2011»
14 years 3 months ago
The Rate of Convergence of AdaBoost
The AdaBoost algorithm was designed to combine many “weak” hypotheses that perform slightly better than random guessing into a “strong” hypothesis that has very low error....
Indraneel Mukherjee, Cynthia Rudin, Robert E. Scha...
DNA
2011
Springer
233views Bioinformatics» more  DNA 2011»
13 years 11 months ago
Less Haste, Less Waste: On Recycling and Its Limits in Strand Displacement Systems
We study the potential for molecule recycling in chemical reaction systems and their DNA strand displacement realizations. Recycling happens when a product of one reaction is a rea...
Anne Condon, Alan J. Hu, Ján Manuch, Chris ...
CL
2012
Springer
13 years 2 months ago
Maintaining distributed logic programs incrementally
Distributed logic programming languages, that allow both facts and programs to be distributed among different nodes in a network, have been recently proposed and used to declarati...
Vivek Nigam, Limin Jia, Boon Thau Loo, Andre Scedr...
CSR
2007
Springer
15 years 6 months ago
Proving Church's Thesis
t) Yuri Gurevich Microsoft Research The talk reflects recent joint work with Nachum Dershowitz [4]. In 1936, Church suggested that the recursive functions, which had been defined...
Yuri Gurevich