Sciweavers

22 search results - page 2 / 5
» The Rademacher Complexity of Linear Transformation Classes
Sort
View
JSW
2007
120views more  JSW 2007»
13 years 5 months ago
Constraint-based Model Transformation: Tracing the Preservation of Semantic Properties
Abstract— We present and evaluate a novel constraintbased model transformation approach that implements a preservation-centric view. The proposed framework comprises formal prese...
Thomas Triebsees
ISCAS
2008
IEEE
106views Hardware» more  ISCAS 2008»
13 years 12 months ago
Hilbert transformers with a piecewise-polynomial-sinusoidal impulse response
— Hilbert transformers are one of the very important special classes of finite impulse response (FIR) filters used in signal processing applications. A method is presented to s...
Raija Lehto, Tapio Saramäki, Olli Vainio
PR
2008
129views more  PR 2008»
13 years 5 months ago
A comparison of generalized linear discriminant analysis algorithms
7 Linear discriminant analysis (LDA) is a dimension reduction method which finds an optimal linear transformation that maximizes the class separability. However, in undersampled p...
Cheong Hee Park, Haesun Park
TIT
2008
147views more  TIT 2008»
13 years 5 months ago
On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes
Error-correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, the connections between codes, matroids, and a special cla...
Ronald Cramer, Vanesa Daza, Ignacio Gracia, Jorge ...
CRYPTO
2005
Springer
171views Cryptology» more  CRYPTO 2005»
13 years 11 months ago
On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes
Error correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, we study the connections between codes, matroids, and a s...
Ronald Cramer, Vanesa Daza, Ignacio Gracia, Jorge ...