Sciweavers

1449 search results - page 139 / 290
» Finiteness results for sigmoidal
Sort
View
CSL
2008
Springer
15 years 8 months ago
On the Almighty Wand
We investigate decidability, complexity and expressive power issues for (first-order) separation logic with one record field (herein called SL) and its fragments. SL can specify pr...
Rémi Brochenin, Stéphane Demri, &Eac...
CSR
2008
Springer
15 years 8 months ago
On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata
Abstract. While visibly pushdown languages properly generalise regular languages and are properly contained in deterministic context-free languages, the complexity of their members...
Nutan Limaye, Meena Mahajan, Antoine Meyer
FPL
2008
Springer
178views Hardware» more  FPL 2008»
15 years 8 months ago
High-speed regular expression matching engine using multi-character NFA
An approach is presented for high throughput matching of regular expressions (regexes) by first converting them into corresponding Non-deterministic Finite Automata (NFAs) which a...
Norio Yamagaki, Reetinder P. S. Sidhu, Satoshi Kam...
LREC
2010
159views Education» more  LREC 2010»
15 years 7 months ago
Towards Optimal TTS Corpora
Unit selection text-to-speech systems currently produce very natural synthesized phrases by concatenating speech segments from a large database. Recently, increasing demand for de...
Didier Cadic, Cédric Boidin, Christophe d'A...
ACST
2006
15 years 7 months ago
Domain decomposition by radial basis functions for time dependent partial differential equations
In the last years, there has been an increased investigation of efficient algorithms to solve problems of great scale. The main restriction of the traditional methods, like finite...
José Antonio Muñoz-Gómez, Ped...