Sciweavers

8699 search results - page 326 / 1740
» Elements of the Theory of Computation
Sort
View
ACL
2010
15 years 4 months ago
Efficient Inference through Cascades of Weighted Tree Transducers
Weighted tree transducers have been proposed as useful formal models for representing syntactic natural language processing applications, but there has been little description of ...
Jonathan May, Kevin Knight, Heiko Vogler
ICTAC
2010
Springer
15 years 4 months ago
Mechanized Verification with Sharing
We consider software verification of imperative programs by theorem proving in higher-order separation logic. Of particular interest are the difficulties of encoding and reasoning ...
J. Gregory Malecha, Greg Morrisett
STOC
2012
ACM
251views Algorithms» more  STOC 2012»
13 years 9 months ago
Minimax option pricing meets black-scholes in the limit
Option contracts are a type of financial derivative that allow investors to hedge risk and speculate on the variation of an asset’s future market price. In short, an option has...
Jacob Abernethy, Rafael M. Frongillo, Andre Wibiso...
IPPS
2003
IEEE
16 years 1 days ago
Partitioning with Space-Filling Curves on the Cubed-Sphere
Numerical methods for solving the systems of partial differential equations arising in geophysical fluid dynamics rely on a variety of spatial discretization schemes (e.g. finit...
John M. Dennis
STOC
2005
ACM
144views Algorithms» more  STOC 2005»
16 years 7 months ago
Pseudorandom generators for low degree polynomials
We investigate constructions of pseudorandom generators that fool polynomial tests of degree d in m variables over finite fields F. Our main construction gives a generator with se...
Andrej Bogdanov