Sciweavers

266 search results - page 6 / 54
» Linear Recursion
Sort
View
ACTA
2007
114views more  ACTA 2007»
15 years 2 months ago
Recursive descent parsing for Boolean grammars
The recursive descent parsing method for the context-free grammars is extended for their generalization, Boolean grammars, which include explicit set-theoretic operations in the f...
Alexander Okhotin
105
Voted
PG
2003
IEEE
15 years 7 months ago
Bounding Recursive Procedural Models Using Convex Optimization
We present an algorithm to construct a tight bounding polyhedron for a recursive procedural model. We first use an iterated function system (IFS) to represent the extent of the p...
Orion Sky Lawlor, John C. Hart
APLAS
2004
ACM
15 years 7 months ago
A Functional Language for Logarithmic Space
Abstract. More than being just a tool for expressing algorithms, a welldesigned programming language allows the user to express her ideas efficiently. The design choices however e...
Peter Møller Neergaard
CORR
2006
Springer
83views Education» more  CORR 2006»
15 years 2 months ago
Fast linear algebra is stable
In [12] we showed that a large class of fast recursive matrix multiplication algorithms is stable in a normwise sense, and that in fact if multiplication of n-by-n matrices can be...
James Demmel, Ioana Dumitriu, Olga Holtz
FOCS
1991
IEEE
15 years 5 months ago
Dynamic Three-Dimensional Linear Programming
We perform linear programming optimizations on the intersection of k polyhedra in R3 , represented by their outer recursive decompositions, in expected time O(k log k log n + √ ...
David Eppstein