Sciweavers

217 search results - page 28 / 44
» Circuit Complexity of Regular Languages
Sort
View
IPPS
1996
IEEE
15 years 1 months ago
A New Approach to Pipeline FFT Processor
A new VLSI architecture for real-time pipeline FFT processor is proposed. A hardware oriented radix-22 algorithm is derived by integrating a twiddle factor decomposition technique ...
Shousheng He, Mats Torkelson
84
Voted
ENTCS
2002
103views more  ENTCS 2002»
14 years 9 months ago
Deciding low levels of tree-automata hierarchy
The paper discusses the hierarchy of indices of finite automata over infinite objects. This hierarchy corresponds exactly to the hierarchy of alternations of least and greatest fi...
Igor Walukiewicz
NAACL
2010
14 years 7 months ago
Why Synchronous Tree Substitution Grammars?
Synchronous tree substitution grammars are a translation model that is used in syntax-based machine translation. They are investigated in a formal setting and compared to a compet...
Andreas Maletti
88
Voted
DBPL
1999
Springer
114views Database» more  DBPL 1999»
15 years 1 months ago
Structured Document Transformations Based on XSL
Abstract. Based on the recursion mechanism of the XML transformation language XSL, the document transformation language DTL is defined. First the instantiation DTLreg is considere...
Sebastian Maneth, Frank Neven
PPDP
2009
Springer
15 years 4 months ago
A declarative encoding of telecommunications feature subscription in SAT
This paper describes the encoding of a telecommunications feature subscription configuration problem to propositional logic and its solution using a state-of-the-art Boolean sati...
Michael Codish, Samir Genaim, Peter J. Stuckey