Sciweavers

513 search results - page 42 / 103
» Finitely Based, Finite Sets of Words
Sort
View
ASAP
2004
IEEE
160views Hardware» more  ASAP 2004»
15 years 10 months ago
Architectural Support for Arithmetic in Optimal Extension Fields
Public-key cryptosystems generally involve computation-intensive arithmetic operations, making them impractical for software implementation on constrained devices such as smart ca...
Johann Großschädl, Sandeep S. Kumar, Ch...
JCSS
2008
73views more  JCSS 2008»
15 years 6 months ago
Structure identification of Boolean relations and plain bases for co-clones
We give a quadratic algorithm for the following structure identification problem: given a Boolean relation R and a finite set S of Boolean relations, can the relation R be express...
Nadia Creignou, Phokion G. Kolaitis, Bruno Zanutti...
SIAMCOMP
2000
109views more  SIAMCOMP 2000»
15 years 6 months ago
Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph
Abstract. We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and parti...
Endre Boros, Vladimir Gurvich, Leonid Khachiyan, K...
GRC
2005
IEEE
16 years 9 days ago
An evolution strategy for the induction of fuzzy finite-state automata
: This study presents an evolution strategy used to infer fuzzy finite-state automata from examples of a fuzzy language. We describe the fitness function of an generated automata w...
Zhiwen Mo, Min Wan, Lan Shu
AUTOMATICA
2006
91views more  AUTOMATICA 2006»
15 years 6 months ago
Necessary and sufficient conditions for reachability on a simplex
In this paper we solve the general problem of designing a feedback controller to reach a set of facets of an n-dimensional simplex in finite time, for a system evolving with linea...
Bartek Roszak, Mireille E. Broucke