Sciweavers

1578 search results - page 153 / 316
» Algorithmic randomness of continuous functions
Sort
View
BMCBI
2010
117views more  BMCBI 2010»
13 years 10 months ago
New decoding algorithms for Hidden Markov Models using distance measures on labellings
Background: Existing hidden Markov model decoding algorithms do not focus on approximately identifying the sequence feature boundaries. Results: We give a set of algorithms to com...
Daniel G. Brown 0001, Jakub Truszkowski
GLVLSI
2005
IEEE
118views VLSI» more  GLVLSI 2005»
14 years 3 months ago
High-diagnosability online built-in self-test of FPGAs via iterative bootstrapping
We develop a novel on-line built-in self-test (BIST) technique for testing FPGAs that has a very high diagnosability even in presence of clustered faults, a fault pattern for whic...
Vishal Suthar, Shantanu Dutt
CRYPTO
2006
Springer
92views Cryptology» more  CRYPTO 2006»
14 years 1 months ago
Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs
In this paper we formalize a general model of cryptanalytic time/memory tradeoffs for the inversion of a random function f : {0, 1, . . . , N - 1} {0, 1, . . . , N - 1}. The model...
Elad Barkan, Eli Biham, Adi Shamir
CORR
2010
Springer
209views Education» more  CORR 2010»
13 years 10 months ago
An Algorithm to Extract Rules from Artificial Neural Networks for Medical Diagnosis Problems
Artificial neural networks (ANNs) have been successfully applied to solve a variety of classification and function approximation problems. Although ANNs can generally predict bett...
S. M. Kamruzzaman, Md. Monirul Islam
CORR
2007
Springer
106views Education» more  CORR 2007»
13 years 10 months ago
Bandit Algorithms for Tree Search
Bandit based methods for tree search have recently gained popularity when applied to huge trees, e.g. in the game of go [6]. Their efficient exploration of the tree enables to ret...
Pierre-Arnaud Coquelin, Rémi Munos