Sciweavers

62 search results - page 4 / 13
» Modified bar recursion
Sort
View
PODS
2005
ACM
131views Database» more  PODS 2005»
14 years 9 months ago
Buffering in query evaluation over XML streams
All known algorithms for evaluating advanced XPath queries (e.g., ones with predicates or with closure axes) on XML streams employ buffers to temporarily store fragments of the do...
Ziv Bar-Yossef, Marcus Fontoura, Vanja Josifovski
HASKELL
2009
ACM
14 years 4 months ago
Finding the needle: stack traces for GHC
Even Haskell programs can occasionally go wrong. Programs calling head on an empty list, and incomplete patterns in function definitions can cause program crashes, reporting littl...
Tristan O. R. Allwood, Simon Peyton Jones, Susan E...
LICS
2003
IEEE
14 years 2 months ago
Polynomial-time Algorithms from Ineffective Proofs
We present a constructive procedure for extracting polynomial-time realizers from ineffective proofs of Π0 2theorems in feasible analysis. By ineffective proof we mean a proof wh...
Paulo Oliva
JCT
2010
117views more  JCT 2010»
13 years 8 months ago
(2+2)-free posets, ascent sequences and pattern avoiding permutations
Abstract. We present bijections between four classes of combinatorial objects. Two of them, the class of unlabeled (2 + 2)-free posets and a certain class of involutions (or chord ...
Mireille Bousquet-Mélou, Anders Claesson, M...
HPDC
1996
IEEE
14 years 1 months ago
Mobile Processing in Open Systems
A universal spatial automaton, called WAVE, for highly parallel processing in arbitrary distributed systems is described. The automaton is based on a virus principle where recursi...
Peter Sapaty