Sciweavers

3608 search results - page 124 / 722
» computer 2011
Sort
View
147
Voted
FOSSACS
2011
Springer
14 years 7 months ago
Coalgebraic Walks, in Quantum and Turing Computation
The paper investigates non-deterministic, probabilistic and quantum walks, from the perspective of coalgebras and monads. Nondeterministic and probabilistic walks are coalgebras of...
Bart Jacobs
139
Voted
TCS
2011
14 years 10 months ago
Computational processes, observers and Turing incompleteness
We propose a formal definition of Wolfram’s notion of computational process based on iterated transducers together with a weak observer, a model of computation that captures so...
Klaus Sutner
158
Voted
FTCGV
2011
122views more  FTCGV 2011»
14 years 7 months ago
Structured Learning and Prediction in Computer Vision
Powerful statistical models that can be learned efficiently from large amounts of data are currently revolutionizing computer vision. These models possess a rich internal structur...
Sebastian Nowozin, Christoph H. Lampert
304
Voted
HICSS
2011
IEEE
386views Biometrics» more  HICSS 2011»
14 years 7 months ago
Cloud Hooks: Security and Privacy Issues in Cloud Computing
In meteorology, the most destructive extratropical cyclones evolve with the formation of a bent-back front and cloud head separated from the main polar-front, creating a hook that...
Wayne A. Jansen
113
Voted
CORR
2011
Springer
205views Education» more  CORR 2011»
14 years 10 months ago
On the algebraic numbers computable by some generalized Ehrenfest urns
This article deals with some stochastic population protocols, motivated by theoretical aspects of distributed computing. We modelize the problem by a large urn of black and white ...
Marie Albenque, Lucas Gerin