Sciweavers

2 search results - page 1 / 1
» Counting and Verifying Maximal Palindromes
Sort
View
SPIRE
2010
Springer
13 years 3 months ago
Counting and Verifying Maximal Palindromes
Abstract. A palindrome is a symmetric string that reads the same forward and backward. Let Pals(w) denote the set of maximal palindromes of a string w in which each palindrome is r...
Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayu...
RSP
2005
IEEE
164views Control Systems» more  RSP 2005»
13 years 10 months ago
High Level Synthesis for Data-Driven Applications
Abstract— John von Neumann proposed his famous architecture in a context where hardware was very expensive and bulky. His goal was to maximize functionality with minimal hardware...
Etienne Bergeron, Xavier Saint-Mleux, Marc Feeley,...