Sciweavers

207 search results - page 6 / 42
» Canonical Forms for Data-Specifications
Sort
View
CADE
2003
Springer
15 years 10 months ago
Canonization for Disjoint Unions of Theories
If there exist efficient procedures (canonizers) for reducing terms of two first-order theories to canonical form, can one use them to construct such a procedure for terms of the d...
Sava Krstic, Sylvain Conchon
WCE
2007
14 years 11 months ago
VHDL Implementation of Multiplierless, High Performance DWT Filter Bank
—The JPEG 2000 image coding standard employs the biorthogonal 9/7 wavelet for lossy compression. The performance of hardware implementation of 9/7-filter bank depends on accuracy...
M. M. Aswale, R. B. Patil
ENTCS
2008
116views more  ENTCS 2008»
14 years 9 months ago
A Bidirectional Refinement Type System for LF
We present a system of refinement types for LF in the style of recent formulations where only canonical forms are well-typed. Both the usual LF rules and the rules for type refine...
William Lovas, Frank Pfenning
TNN
1998
99views more  TNN 1998»
14 years 9 months ago
Comments on local minima free conditions in multilayer perceptrons
—In this letter we point out that multilayer neural networks (MLP’s) with either sigmoidal units or radial basis functions can be given a canonical form with positive interunit...
Marco Gori, Ah Chung Tsoi
CSR
2008
Springer
14 years 11 months ago
From Invariants to Canonization in Parallel
A function f of a graph is called a complete graph invariant if two given graphs G and H are isomorphic exactly when f(G) = f(H). If additionally, f(G) is a graph isomorphic to G, ...
Johannes Köbler, Oleg Verbitsky