Sciweavers

1477 search results - page 175 / 296
» Pattern Matching with Swaps
Sort
View
90
Voted
FLOPS
2006
Springer
15 years 6 months ago
Resource Analysis by Sup-interpretation
We propose a new method to control memory resources by static analysis. For this, we introduce the notion of sup-interpretation which bounds from above the size of function outputs...
Jean-Yves Marion, Romain Péchoux
92
Voted
MPC
2000
Springer
105views Mathematics» more  MPC 2000»
15 years 6 months ago
The Universal Resolving Algorithm: Inverse Computation in a Functional Language
Abstract. We present an algorithm for inverse computation in a rstorder functional language based on the notion of a perfect process tree. The Universal Resolving Algorithm (URA) i...
Sergei M. Abramov, Robert Glück
LICS
1991
IEEE
15 years 5 months ago
Higher-Order Critical Pairs
Abstract. We extend the termination proof methods based on reduction orderings to higher-order rewriting systems `a la Nipkow using higher-order pattern matching for firing rules,...
Tobias Nipkow
ACL
2008
15 years 3 months ago
Pairwise Document Similarity in Large Collections with MapReduce
This paper presents a MapReduce algorithm for computing pairwise document similarity in large document collections. MapReduce is an attractive framework because it allows us to de...
Tamer Elsayed, Jimmy J. Lin, Douglas W. Oard
78
Voted
ESANN
2007
15 years 3 months ago
Several ways to solve the MSO problem
The so called MSO-problem, – a simple superposition of two or more sinusoidal waves –, has recently been discussed as a benchmark problem for reservoir computing and was shown ...
Jochen J. Steil