Sciweavers

3128 search results - page 211 / 626
» Finite element method
Sort
View
EJC
2006
15 years 4 months ago
Invariant subspaces, duality, and covers of the Petersen graph
A general method for finding elementary abelian regular covering projections of finite connected graphs is applied to the Petersen graph. As a result, a complete list of pairwise ...
Aleksander Malnic, Primoz Potocnik
MOC
2000
77views more  MOC 2000»
15 years 3 months ago
Isomorphisms between Artin-Schreier towers
We give a method for efficiently computing isomorphisms between towers of Artin-Schreier extensions over a finite field. We find that isomorphisms between towers of degree pn over ...
Jean Marc Couveignes
ASPDAC
2001
ACM
107views Hardware» more  ASPDAC 2001»
15 years 7 months ago
An efficient solution to the storage correspondence problem for large sequential circuits
Abstract- Traditional state-traversal-basedmethods for verifying sequential circuits are computationally infeasible for circuits with a large number of memory elements. However, if...
Wanlin Cao, D. M. H. Walker, Rajarshi Mukherjee
ICASSP
2009
IEEE
15 years 10 months ago
Generalization of specialized on-the-fly composition
In the Weighted Finite State Transducer (WFST) framework for speech recognition, we can reduce memory usage and increase flexibility by using on-the-fly composition which genera...
Tasuku Oonishi, Paul R. Dixon, Koji Iwano, Sadaoki...
FMICS
2007
Springer
15 years 8 months ago
Model Classifications and Automated Verification
Due to the significant progress in automated verification, there are often several techniques for a particular verification problem. In many circumstances different techniques are ...
Radek Pelánek