Sciweavers

73 search results - page 11 / 15
» A Permutation Regularity Lemma
Sort
View
FINTAL
2006
13 years 10 months ago
Morphological Lexicon Extraction from Raw Text Data
The tool extract enables the automatic extraction of lemma-paradigm pairs from raw text data. The tool uses search patterns that consist of regular expressions and propositional lo...
Markus Forsberg, Harald Hammarström, Aarne Ra...
SIAMCO
2000
75views more  SIAMCO 2000»
13 years 6 months ago
Generic Simplicity of the Spectrum and Stabilization for a Plate Equation
In this work we prove the generic simplicity of the spectrum of the clamped plate equation in a bounded regular domain of Rd. That is, given Rd, we show that there exists an arbi...
Jaime H. Ortega, Enrique Zuazua
STOC
2003
ACM
114views Algorithms» more  STOC 2003»
14 years 7 months ago
Testing subgraphs in directed graphs
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
Noga Alon, Asaf Shapira
ISCAS
2008
IEEE
287views Hardware» more  ISCAS 2008»
14 years 1 months ago
A high speed word level finite field multiplier using reordered normal basis
— Reordered normal basis is a certain permutation of a type II optimal normal basis. In this paper, a high speed design of a word level finite field multiplier using reordered ...
Ashkan Hosseinzadeh Namin, Huapeng Wu, Majid Ahmad...
DLT
2003
13 years 8 months ago
On Deterministic Finite Automata and Syntactic Monoid Size, Continued
We continue our investigation on the relationship between regular languages and syntactic monoid size. In this paper we confirm the conjecture on two generator transformation semi...
Markus Holzer, Barbara König