1208 search results - page 70 / 242 » Uniform eventown problems |
159
click to vote
POPL
2005
ACM
15 years 10 months ago
2005
ACM
As probabilistic computations play an increasing role in solving various problems, researchers have designed probabilistic languages that treat probability distributions as primit...
VMCAI
2010
Springer
15 years 7 months ago
2010
Springer
We present uniform approaches to establish complexity bounds for decision problems such as reachability and simulation, that arise naturally in the verification of timed software s...
COCO
2009
Springer
15 years 4 months ago
2009
Springer
We prove that poly-sized AC0 circuits cannot distinguish a poly-logarithmically independent distribution from the uniform one. This settles the 1990 conjecture by Linial and Nisan...
85
Voted
DAWAK
2007
Springer
15 years 4 months ago
2007
Springer
In this paper, we deal with the problem of performing what-if analysis for changes that occur in the schema/structure of the data warehouse We abstract software modules, queries, r...
121
click to vote
ACRI
2004
Springer
15 years 3 months ago
2004
Springer
Cellular automata (CA) are highly parallel and discrete dynamical systems, whose behavior is completely specified in terms of a local relation. They were successfully applied for s...