1888 search results - page 260 / 378 » Proof theory and computational analysis |
CSR
2007
Springer
15 years 8 months ago
2007
Springer
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...
115
Voted
CORR
2011
Springer
14 years 8 months ago
2011
Springer
Let f be a univariate polynomial with real coefficients, f ∈ R[X]. Subdivision algorithms based on algebraic techniques (e.g., Sturm or Descartes methods) are widely used for is...
115
click to vote
RTSS
2007
IEEE
15 years 8 months ago
2007
IEEE
The increased complexity of performance-sensitive software systems leads to increased use of automated adaptation policies in lieu of manual performance tuning. Composition of ada...
136
click to vote
CORR
2011
Springer
14 years 5 months ago
2011
Springer
Decomposition theorems in classical Fourier analysis enable us to express a bounded function in terms of few linear phases with large Fourier coefficients plus a part that is pseu...
SIGGRAPH
1999
ACM
15 years 6 months ago
1999
ACM
The reflection of light from surfaces is a fundamental problem in computer graphics. Although many reflection models have been proposed, few take into account the wave nature of...