1089 search results - page 12 / 218 » Randomness and Reducibility |
BSL
2005
13 years 7 months ago
2005
A mass problem is a set of Turing oracles. If P and Q are mass problems, we say that P is weakly reducible to Q if every member of Q Turing computes a member of P. We say that P i...
EDBT
2006
ACM
13 years 9 months ago
2006
ACM
Random sampling is a well-known technique for approximate processing of large datasets. We introduce a set of algorithms for incremental maintenance of large random samples on seco...
ICMCS
2006
IEEE
14 years 1 months ago
2006
IEEE
To announce the ownership of video such as TV programs, the owner usually embeds his logo into the programs in a visible way. Since the logo and its position are usually fixed in...
CAV
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Constrained random simulation is supported by constraint solvers integrated within simulators. These constraint solvers need to be fast and memory efficient to maintain s...
ICMLA
2004
13 years 9 months ago
2004
Abstract-- This paper introduces a generalization of the Gravitational Clustering Algorithm proposed by Gomez et all in [1]. First, it is extended in such a way that not only the G...