Sciweavers

490 search results - page 23 / 98
» Equivalent Keys of HPC
Sort
View
AAECC
2009
Springer
140views Algorithms» more  AAECC 2009»
13 years 9 months ago
Interesting Examples on Maximal Irreducible Goppa Codes
In this paper a full categorization of irreducible classical Goppa codes of degree 4 and length 9 is given. It is an interesting example in the context of find the number of permut...
Marta Giorgetti
AUTOMATICA
2007
70views more  AUTOMATICA 2007»
13 years 8 months ago
On detectability of stochastic systems
We discuss notions of detectability for stochastic linear control systems of Itˆo type. A natural concept of detectability requires a non-zero output, if the state process is uns...
Tobias Damm
JAIR
2006
155views more  JAIR 2006»
13 years 8 months ago
A Comparison of Different Machine Transliteration Models
Machine transliteration is a method for automatically converting words in one language into phonetically equivalent ones in another language. Machine transliteration plays an impo...
Jong-Hoon Oh, Key-Sun Choi, Hitoshi Isahara
DAM
2002
280views more  DAM 2002»
13 years 8 months ago
On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem
It is proved that seven different approaches to the multi-peg Tower of Hanoi problem are all equivalent. Among them the classical approaches of Stewart and Frame from 1941 can be ...
Sandi Klavzar, Uros Milutinovic, Ciril Petr
INFORMATICALT
2000
160views more  INFORMATICALT 2000»
13 years 8 months ago
An Algorithm for Transformation of Finite Automata to Regular Expressions
An original algorithm for transformation of finite automata to regular expressions is presented. This algorithm is based on effective graph algorithms and gives a transparent new p...
Larisa Stanevichene, Aleksei Vylitok