Sciweavers

2950 search results - page 4 / 590
» Computing with Infinitely Many Processes
Sort
View
CIE
2008
Springer
13 years 9 months ago
Computable Categoricity of Graphs with Finite Components
A computable graph is computably categorical if any two computable presentations of the graph are computably isomorphic. In this paper we investigate the class of computably catego...
Barbara F. Csima, Bakhadyr Khoussainov, Jiamou Liu
NC
2006
130views Neural Networks» more  NC 2006»
13 years 7 months ago
Dynamic self-assembly in living systems as computation
Biochemical reactions taking place in living systems that map different inputs to specific outputs are intuitively recognized as performing information processing. Conventional wis...
Ann M. Bouchard, Gordon C. Osbourn
NIPS
2001
13 years 9 months ago
The Infinite Hidden Markov Model
We show that it is possible to extend hidden Markov models to have a countably infinite number of hidden states. By using the theory of Dirichlet processes we can implicitly integ...
Matthew J. Beal, Zoubin Ghahramani, Carl Edward Ra...
BMVC
2002
13 years 10 months ago
Practical Generation of Video Textures using the Auto-Regressive Process
Recently, there have been several attempts at creating `video textures', that is, synthesising new (potentially infinitely long) video clips based on existing ones. One way t...
Neill W. Campbell, Colin J. Dalton, David P. Gibso...
JMLR
2010
184views more  JMLR 2010»
13 years 2 months ago
Sequential Monte Carlo Samplers for Dirichlet Process Mixtures
In this paper, we develop a novel online algorithm based on the Sequential Monte Carlo (SMC) samplers framework for posterior inference in Dirichlet Process Mixtures (DPM) (DelMor...
Yener Ülker, Bilge Günsel, Ali Taylan Ce...