Sciweavers

1004 search results - page 61 / 201
» A comparison of generalized linear discriminant analysis alg...
Sort
View
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
14 years 9 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy
WPES
2003
ACM
14 years 1 months ago
Secure and private sequence comparisons
We give an efficient protocol for sequence comparisons of the edit-distance kind, such that neither party reveals anything about their private sequence to the other party (other t...
Mikhail J. Atallah, Florian Kerschbaum, Wenliang D...
GECCO
2009
Springer
112views Optimization» more  GECCO 2009»
14 years 3 months ago
Soft memory for stock market analysis using linear and developmental genetic programming
Recently, a form of memory usage was introduced for genetic programming (GP) called “soft memory.” Rather than have a new value completely overwrite the old value in a registe...
Garnett Carl Wilson, Wolfgang Banzhaf
DATE
2008
IEEE
148views Hardware» more  DATE 2008»
14 years 3 months ago
On Analysis and Synthesis of (n, k)-Non-Linear Feedback Shift Registers
— Non-Linear Feedback Shift Registers (NLFSRs) have been proposed as an alternative to Linear Feedback Shift Registers (LFSRs) for generating pseudo-random sequences for stream c...
Elena Dubrova, Maxim Teslenko, Hannu Tenhunen
ICIP
2007
IEEE
14 years 10 months ago
Large Scale Learning of Active Shape Models
We propose a framework to learn statistical shape models for faces as piecewise linear models. Specifically, our methodology builds upon primitive active shape models(ASM) to hand...
Atul Kanaujia, Dimitris N. Metaxas