490 search results - page 23 / 98 » Equivalent Keys of HPC |
94
Voted
AAECC
2009
Springer
15 years 3 months ago
2009
Springer
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...
95
Voted
AUTOMATICA
2007
15 years 1 months ago
2007
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...
78
Voted
JAIR
2006
15 years 1 months ago
2006
Machine transliteration is a method for automatically converting words in one language into phonetically equivalent ones in another language. Machine transliteration plays an impo...
117
click to vote
DAM
2002
15 years 1 months ago
2002
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 ...
128
Voted
INFORMATICALT
2000
15 years 1 months ago
2000
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...