Sciweavers

3373 search results - page 388 / 675
» Linear transformations on codes
Sort
View
DLT
2008
15 years 5 months ago
Extended Multi Bottom-Up Tree Transducers
Extended multi bottom-up tree transducers are de ned and investigated. They are an extension of multi bottom-up tree transducers by arbitrary, not just shallow, left-hand sides of ...
Joost Engelfriet, Eric Lilin, Andreas Maletti
149
Voted
SMA
2010
ACM
195views Solid Modeling» more  SMA 2010»
15 years 4 months ago
Piecewise 3D Euler spirals
3D Euler spirals are visually pleasing, due to their property of having their curvature and their torsion change linearly with arc-length. This paper presents a novel algorithm fo...
David Ben-Haim, Gur Harary, Ayellet Tal
IANDC
2008
86views more  IANDC 2008»
15 years 3 months ago
Unambiguous Boolean grammars
Abstract. Boolean grammars are an extension of context-free grammars, in which all propositional connectives are allowed. In this paper, the notion of ambiguity in Boolean grammars...
Alexander Okhotin
JSAT
2006
87views more  JSAT 2006»
15 years 3 months ago
Hard Satisfiable Clause Sets for Benchmarking Equivalence Reasoning Techniques
A family of satisfiable benchmark instances in conjunctive normal form is introduced. The instances are constructed by transforming a random regular graph into a system of linear ...
Harri Haanpää, Matti Järvisalo, Pet...
IANDC
2010
84views more  IANDC 2010»
15 years 2 months ago
Modules over monads and initial semantics
Inspired by the classical theory of modules over a monoid, we introduce the natural notion of module over a monad. The associated notion of morphism of left modules (”linear” n...
André Hirschowitz, Marco Maggesi