10271 search results - page 375 / 2055 » Computer Science |
113
click to vote
STACS
2009
Springer
15 years 11 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, ...
136
click to vote
CSR
2006
Springer
15 years 8 months ago
2006
Springer
A central object of study in the field of algorithmic randomness are notions of randomness for sequences, i.e., infinite sequences of zeros and ones. These notions are usually def...
127
click to vote
TCS
2010
15 years 2 months ago
2010
Abstract. Core computation in data exchange is concerned with materializing the minimal target database for a given source database. Gottlob and Nash have recently shown that the c...
115
click to vote
GI
2009
Springer
15 years 2 months ago
2009
Springer
: In this paper we explore the possibilities to perform the search for results of non-deterministic computations in parallel. We present three different approaches to this problem:...
GI
2007
Springer
15 years 10 months ago
2007
Springer
: Many of ADAS applications such as pedestrian and vehicle detection are using stereo vision. By computing the well-known disparity the range of objects ahead of the car can be det...