790 search results - page 56 / 158 » Subexponential Parameterized Algorithms |
109
click to vote
STOC
2000
ACM
15 years 7 months ago
2000
ACM
Abstract. We consider suffix tree construction for situations with missing suffix links. Two examples of such situations are suffix trees for parameterized strings and suffix trees...
128
click to vote
FATES
2004
Springer
15 years 8 months ago
2004
Springer
We present an extension of Tretmans’ theory and algorithm for test generation for input-output transition systems to real-time systems. Our treatment is based on an operational i...
125
click to vote
EDOC
2008
IEEE
15 years 4 months ago
2008
IEEE
We present an algorithm for the runtime monitoring of business process properties with data parameterization. The properties are expressed in LTL-FO+ , an extension to traditional...
127
click to vote
IJCAI
2007
15 years 4 months ago
2007
We investigate three parameterized algorithmic schemes for graphical models that can accommodate trade-offs between time and space: 1) AND/OR Adaptive Caching (AOC(i)); 2) Variabl...
109
click to vote
WSCG
2003
15 years 4 months ago
2003
We describe techniques to establish local frames over point-sampled manifold surfaces. The tangential alignment of local frames is determined using a wave front algorithm starting...