Sciweavers

141 search results - page 17 / 29
» Explicitly Parallel Regular Expressions
Sort
View
CAV
1999
Springer
119views Hardware» more  CAV 1999»
13 years 12 months ago
A Theory of Restrictions for Logics and Automata
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
Nils Klarlund
CICLING
2003
Springer
14 years 23 days ago
Computing with Realizational Morphology
The theory of realizational morphology presented by Stump in his influential book Inflectional Morphology (2001) describes the derivation of inflected surface forms from underly...
Lauri Karttunen
SIGGRAPH
1998
ACM
13 years 11 months ago
Exact Evaluation of Catmull-Clark Subdivision Surfaces at Arbitrary Parameter Values
In this paper we disprove the belief widespread within the computer graphics community that Catmull-Clark subdivision surfaces cannot be evaluated directly without explicitly subd...
Jos Stam
INFOCOM
1995
IEEE
13 years 11 months ago
Analysis of One-Way Reservation Algorithms
Modern high speed networks and ATM networks in particular use resource reservation as a basic means of establishing communications. One-way on-the- y reservation is a method for...
Israel Cidon, Raphael Rom, Yuval Shavitt
UAI
2003
13 years 9 months ago
Learning Module Networks
Methods for learning Bayesian networks can discover dependency structure between observed variables. Although these methods are useful in many applications, they run into computat...
Eran Segal, Dana Pe'er, Aviv Regev, Daphne Koller,...