Sciweavers

2950 search results - page 1 / 590
» Computing with Infinitely Many Processes
Sort
View
WDAG
2000
Springer
72views Algorithms» more  WDAG 2000»
13 years 8 months ago
Computing with Infinitely Many Processes
Michael Merritt, Gadi Taubenfeld
NDJFL
2010
13 years 1 days ago
An Extension of van Lambalgen's Theorem to Infinitely Many Relative 1-Random Reals
Van Lambalgen's Theorem plays an important role in algorithmic randomness, especially when studying relative randomness. In this paper we extend van Lambalgen's Theorem ...
Kenshi Miyabe
ICML
2006
IEEE
14 years 6 months ago
A choice model with infinitely many latent features
Elimination by aspects (EBA) is a probabilistic choice model describing how humans decide between several options. The options from which the choice is made are characterized by b...
Carl Edward Rasmussen, Dilan Görür, Fran...
CORR
2010
Springer
88views Education» more  CORR 2010»
13 years 2 months ago
Infinite Time Cellular Automata: A Real Computation Model
We define a new transfinite time model of computation, infinite time cellular automata. The model is shown to be as powerful than infinite time Turing machines, both on finite and ...
Fabien Givors, Grégory Lafitte, Nicolas Oll...
ICML
2007
IEEE
14 years 6 months ago
Infinite mixtures of trees
Finite mixtures of tree-structured distributions have been shown to be efficient and effective in modeling multivariate distributions. Using Dirichlet processes, we extend this ap...
Sergey Kirshner, Padhraic Smyth