Sciweavers

7393 search results - page 962 / 1479
» Synthesis-for-testability using transformations
Sort
View
CN
2004
89views more  CN 2004»
15 years 6 months ago
On the testability of SDL specifications
The problem of testing from an SDL specification is often complicated by the presence of infeasible paths. This paper introduces an approach for transforming a class of SDL specif...
Robert M. Hierons, T.-H. Kim, Hasan Ural
COMPUTING
2004
143views more  COMPUTING 2004»
15 years 6 months ago
Biorthogonal Loop-Subdivision Wavelets
We present a biorthogonal wavelet construction for Loop subdivision, based on the lifting scheme. Our wavelet transform uses scaling functions that are recursively defined by Loop...
Martin Bertram
CORR
2000
Springer
138views Education» more  CORR 2000»
15 years 6 months ago
Towards rule-based visual programming of generic visual systems
This paper illustrates how the diagram programming language DIAPLAN can be used to program visual systems. DIAPLAN is a visual rulebased language that is founded on the computation...
Berthold Hoffmann, Mark Minas
CORR
2002
Springer
123views Education» more  CORR 2002»
15 years 6 months ago
Ideal decompositions and computation of tensor normal forms
Abstract. Symmetry properties of r-times covariant tensors T can be described by certain linear subspaces W of the group ring K[Sr] of a symmetric group Sr. If for a class of tenso...
Bernd Fiedler
158
Voted
CORR
2002
Springer
101views Education» more  CORR 2002»
15 years 6 months ago
Quantum Circuits with Unbounded Fan-out
We demonstrate that the unbounded fan-out gate is very powerful. Constant-depth polynomial-size quantum circuits with bounded fan-in and unbounded fan-out over a fixed basis (denot...
Peter Høyer, Robert Spalek