Sciweavers

61 search results - page 7 / 13
» ipl 2007
Sort
View
IPL
2007
130views more  IPL 2007»
14 years 9 months ago
Linear structure of bipartite permutation graphs and the longest path problem
The class of bipartite permutation graphs is the intersection of two well known graph classes: bipartite graphs and permutation graphs. A complete bipartite decomposition of a bip...
Ryuhei Uehara, Gabriel Valiente
IPL
2007
75views more  IPL 2007»
14 years 9 months ago
Some observations on LR-like parsing with delayed reduction
We discuss a bottom-up parsing technique based on delayed reductions, and investigate its capabilities and limitations. Some non-LR(k) grammars, for any k, are handled determinist...
Eberhard Bertsch, Mark-Jan Nederhof
IPL
2007
91views more  IPL 2007»
14 years 9 months ago
Simple deterministic wildcard matching
We present a simple and fast deterministic solution to the string matching with don’t cares problem. The task is to determine all positions in a text where a pattern occurs, all...
Peter Clifford, Raphaël Clifford
IPL
2007
78views more  IPL 2007»
14 years 9 months ago
Ensuring the quasi-termination of needed narrowing computations
We present a characterization of first-order functional programs which are quasiterminating w.r.t. the symbolic execution mechanism of needed narrowing, i.e., computations in the...
J. Guadalupe Ramos, Josep Silva, Germán Vid...
IPL
2007
122views more  IPL 2007»
14 years 9 months ago
On the longest increasing subsequence of a circular list
The longest increasing circular subsequence (LICS) of a list is considered. A Monte-Carlo algorithm to compute it is given which has worst case execution time O(n3/2 log n) and st...
Michael H. Albert, Mike D. Atkinson, Doron Nussbau...