Sciweavers

539 search results - page 29 / 108
» Linear complexity of transformed sequences
Sort
View
PR
2008
129views more  PR 2008»
14 years 9 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
MP
2008
129views more  MP 2008»
14 years 9 months ago
Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
Abstract. Two corrector-predictor interior point algorithms are proposed for solving monotone linear complementarity problems. The algorithms produce a sequence of iterates in the ...
Florian A. Potra
TIT
2008
147views more  TIT 2008»
14 years 9 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 ...
HICSS
2003
IEEE
90views Biometrics» more  HICSS 2003»
15 years 2 months ago
A Prototype for Multiple Whole Genome Alignment
In this paper, we briefly describe a prototype of the software system we have developed for multiple whole genome alignment. To develop our algorithm, we have to solve several pr...
Jitender S. Deogun, Fangrui Ma, Jingyi Yang, Andre...
APLAS
2005
ACM
15 years 3 months ago
Transformation to Dynamic Single Assignment Using a Simple Data Flow Analysis
This paper presents a novel method to construct a dynamic single assignment (DSA) form of array-intensive, pointer-free C programs (or in any other procedural language). A program ...
Peter Vanbroekhoven, Gerda Janssens, Maurice Bruyn...