10304 search results - page 417 / 2061 » Computer science with the sciences: an emphasis in computati... |
155
click to vote
STACS
1997
Springer
15 years 11 months ago
1997
Springer
Various types of probabilistic proof systems have played a central role in the development of computer science in the last decade. In this exposition, we concentrate on three such...
190
Voted
CCCG
2006
15 years 8 months ago
2006
We present a generalization of Welzl's smallest enclosing disk algorithm [E. Welzl, Smallest enclosing disks (balls and ellipsoids), in: New Results and New Trends in Compute...
148
click to vote
JVM
2001
15 years 8 months ago
2001
ompiler for Many Memory Models { extended abstract Samuel P. Midki IBM TJ Watson Research Jaejin Lee Dept. of Computer Science and Engineering, Michigan State University David A. P...
180
click to vote
TCS
2011
15 years 1 months ago
2011
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...
140
click to vote
STACS
2009
Springer
16 years 1 months ago
2009
Springer
We extend the notion of randomness (in the version introduced by Schnorr) to computable Probability Spaces and compare it to a dynamical notion of randomness: typicality. Roughly, ...