Sciweavers

2713 search results - page 2 / 543
» Parameterized Tree Systems
Sort
View
ICALP
2000
Springer
13 years 8 months ago
Decidable First-Order Transition Logics for PA-Processes
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizabil...
Denis Lugiez, Ph. Schnoebelen
CGF
2002
95views more  CGF 2002»
13 years 4 months ago
Intrinsic Parameterizations of Surface Meshes
Parameterization of discrete surfaces is a fundamental and widely-used operation in graphics, required, for instance, for texture mapping or remeshing. As 3D data becomes more and...
Mathieu Desbrun, Mark Meyer, Pierre Alliez
STOC
2000
ACM
117views Algorithms» more  STOC 2000»
13 years 9 months ago
Faster suffix tree construction with missing suffix links
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...
Richard Cole, Ramesh Hariharan
TSE
1998
128views more  TSE 1998»
13 years 4 months ago
Modeling and Evaluating Design Alternatives for an On-Line Instrumentation System: A Case Study
—This paper demonstrates the use of a model-based evaluation approach for instrumentation systems (ISs). The overall objective of this study is to provide early feedback to tool ...
Abdul Waheed, Diane T. Rover, Jeffrey K. Hollingsw...
INLG
2010
Springer
13 years 2 months ago
'If you've heard it, you can say it' - Towards an Account of Expressibility
We have begun a project to automatically create the lexico-syntactic resources for a microplanner as a side-effect of running a domain-specific language understanding system. The ...
David McDonald, Charlie Greenbacker