Sciweavers

300 search results - page 60 / 60
» The Extension Theorem
Sort
View
AML
2008
124views more  AML 2008»
13 years 6 months ago
The elementary computable functions over the real numbers: applying two new techniques
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether def...
Manuel Lameiras Campagnolo, Kerry Ojakian
TAP
2008
Springer
93views Hardware» more  TAP 2008»
13 years 6 months ago
Pex-White Box Test Generation for .NET
Pex automatically produces a small test suite with high code coverage for a .NET program. To this end, Pex performs a systematic program analysis (using dynamic symbolic execution,...
Nikolai Tillmann, Jonathan de Halleux
JLP
2007
89views more  JLP 2007»
13 years 6 months ago
Universality and semicomputability for nondeterministic programming languages over abstract algebras
tract Algebras Wei Jiang∗ , Yuan Wang† , and Jeffery Zucker‡ September 11, 2006 The Universal Function Theorem (UFT) originated in 1930s with the work of Alan Turing, who p...
Wei Jiang, Yuan Wang, Jeffery I. Zucker
TSP
2010
13 years 28 days ago
On the shiftability of dual-tree complex wavelet transforms
The dual-tree complex wavelet transform (DT- WT) is known to exhibit better shift-invariance than the conventional discrete wavelet transform. We propose an amplitude-phase represe...
Kunal Narayan Chaudhury, Michael Unser
MOC
2011
13 years 1 months ago
Computing systems of Hecke eigenvalues associated to Hilbert modular forms
We utilize effective algorithms for computing in the cohomology of a Shimura curve together with the Jacquet-Langlands correspondence to compute systems of Hecke eigenvalues assoc...
Matthew Greenberg, John Voight