Sciweavers

24 search results - page 3 / 5
» Compositions of linear functions and applications to hashing
Sort
View
ICFP
2002
ACM
15 years 11 months ago
Packrat parsing: : simple, powerful, lazy, linear time, functional pearl
Packrat parsing is a novel technique for implementing parsers in a lazy functional programming language. A packrat parser provides the power and flexibility of top-down parsing wi...
Bryan Ford
AMAI
2006
Springer
14 years 11 months ago
Symmetric approximate linear programming for factored MDPs with application to constrained problems
A weakness of classical Markov decision processes (MDPs) is that they scale very poorly due to the flat state-space representation. Factored MDPs address this representational pro...
Dmitri A. Dolgov, Edmund H. Durfee
WEA
2010
Springer
397views Algorithms» more  WEA 2010»
15 years 5 months ago
A New Combinational Logic Minimization Technique with Applications to Cryptology
Abstract. A new technique for combinational logic optimization is described. The technique is a two-step process. In the first step, the nonlinearity of a circuit – as measured ...
Joan Boyar, René Peralta
COCO
2007
Springer
111views Algorithms» more  COCO 2007»
15 years 3 months ago
Efficient Arguments without Short PCPs
Current constructions of efficient argument systems combine a short (polynomial size) PCP with a cryptographic hashing technique. We suggest an alternative approach for this probl...
Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky
TOG
2012
273views Communications» more  TOG 2012»
13 years 1 months ago
Functional maps: a flexible representation of maps between shapes
We present a novel representation of maps between pairs of shapes that allows for efficient inference and manipulation. Key to our approach is a generalization of the notion of m...
Maks Ovsjanikov, Mirela Ben-Chen, Justin Solomon, ...