Sciweavers

3096 search results - page 200 / 620
» Theory and Use of the EM Algorithm
Sort
View
LICS
2003
IEEE
15 years 11 months ago
Polynomial-time Algorithms from Ineffective Proofs
We present a constructive procedure for extracting polynomial-time realizers from ineffective proofs of Π0 2theorems in feasible analysis. By ineffective proof we mean a proof wh...
Paulo Oliva
FSE
1997
Springer
280views Cryptology» more  FSE 1997»
15 years 10 months ago
New Block Encryption Algorithm MISTY
We propose secret-key cryptosystems MISTY1 and MISTY2, which are block ciphers with a 128-bit key, a 64-bit block and a variable number of rounds. MISTY is a generic name for MISTY...
Mitsuru Matsui
AHS
2007
IEEE
262views Hardware» more  AHS 2007»
15 years 8 months ago
A Reed-Solomon Algorithm for FPGA Area Optimization in Space Applications
This work describes an algebraic based design strategy targeting area optimization in reconfigurable computer technology (FPGA). Area optimization is a major issue as smaller comp...
Gabriel Marchesan Almeida, Eduardo Augusto Bezerra...
CORR
2008
Springer
84views Education» more  CORR 2008»
15 years 6 months ago
The Latent Relation Mapping Engine: Algorithm and Experiments
Many AI researchers and cognitive scientists have argued that analogy is the core of cognition. The most influential work on computational modeling of analogy-making is Structure ...
Peter D. Turney
TIFS
2008
157views more  TIFS 2008»
15 years 6 months ago
Subspace Approximation of Face Recognition Algorithms: An Empirical Study
We present a theory for constructing linear subspace approximations to face-recognition algorithms and empirically demonstrate that a surprisingly diverse set of face-recognition a...
Pranab Mohanty, Sudeep Sarkar, Rangachar Kasturi, ...