Sciweavers

283 search results - page 19 / 57
» A New DNA Implementation of Finite State Machines
Sort
View
ICML
2010
IEEE
13 years 8 months ago
Convergence of Least Squares Temporal Difference Methods Under General Conditions
We consider approximate policy evaluation for finite state and action Markov decision processes (MDP) in the off-policy learning context and with the simulation-based least square...
Huizhen Yu
EDBT
2010
ACM
117views Database» more  EDBT 2010»
14 years 2 months ago
Anchoring millions of distinct reads on the human genome within seconds
With the advent of next-generation DNA sequencing machines, there is an increasing need for the development of computational tools that can anchor accurately and expediently the m...
Tien Huynh, Michail Vlachos, Isidore Rigoutsos
JCB
1998
129views more  JCB 1998»
13 years 7 months ago
A Sticker-Based Model for DNA Computation
We introduce a new model of molecular computation that we call the sticker model. Like many previous proposals it makes use of DNA strands as the physical substrate in which infor...
Sam T. Roweis, Erik Winfree, Richard Burgoyne, Nic...
ECML
2006
Springer
13 years 11 months ago
PAC-Learning of Markov Models with Hidden State
The standard approach for learning Markov Models with Hidden State uses the Expectation-Maximization framework. While this approach had a significant impact on several practical ap...
Ricard Gavaldà, Philipp W. Keller, Joelle P...
ICCAD
1994
IEEE
134views Hardware» more  ICCAD 1994»
13 years 11 months ago
Boolean constrained encoding: a new formulation and a case study
1 This paper provides a new, generalized approach to the problem of encoding information as vectors of binary digits. We furnish a formal definition for the Boolean constrained enc...
Ney Laert Vilar Calazans