Sciweavers

2887 search results - page 117 / 578
» Name Generation and Linearity
Sort
View
CORR
2000
Springer
134views Education» more  CORR 2000»
15 years 6 months ago
Learning Complexity Dimensions for a Continuous-Time Control System
This paper takes a computational learning theory approach to a problem of linear systems identification. It is assumed that inputs are generated randomly from a known class consist...
Pirkko Kuusela, Daniel Ocone, Eduardo D. Sontag
IJNSEC
2010
143views more  IJNSEC 2010»
15 years 1 months ago
Nonce Generation For The Digital Signature Standard
Digital Signature Algorithm (DSA) is an underlying algorithm to form a signature in the Digital Signature Standard (DSS). DSA uses a new random number (or nonce) each time a signa...
Rajendra S. Katti, Rajesh G. Kavasseri
ECCC
2007
100views more  ECCC 2007»
15 years 6 months ago
Unconditional pseudorandom generators for low degree polynomials
Abstract: We give an explicit construction of a pseudorandom generator against lowdegree polynomials over finite fields. Pseudorandom generators against linear polynomials, known...
Shachar Lovett
GECCO
2008
Springer
103views Optimization» more  GECCO 2008»
15 years 7 months ago
How generative encodings fare on less regular problems
Generative representations allow the reuse of code and thus facilitate the evolution of repeated phenotypic themes or modules. It has been shown that generative representations pe...
Jeff Clune, Charles Ofria, Robert T. Pennock
ISCAS
1999
IEEE
106views Hardware» more  ISCAS 1999»
15 years 10 months ago
Test pattern generation for width compression in BIST
The main objectives of Built-In Self Test (BIST) are the design of test pattern generator circuits which achieve the highest fault coverage, require the shortest sequence of test ...
Paulo F. Flores, Horácio C. Neto, K. Chakra...