6251 search results - page 2 / 1251 » Randomness, Computability, and Density |
STACS
2012
Springer
12 years 24 days ago
2012
Springer
The Denjoy-Young-Saks Theorem from classical analysis states that for an arbitrary function f : R → R, the Denjoy alternative holds outside a null set, i.e., for almost every re...
CP
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. This paper contains an experimental study of the impact of the construction strategy of reduced, ordered binary decision diagrams (ROBDDs) on the average-case computation...
CP
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. This paper presents an experimental investigation of the following questions: how does the averagecase complexity of random 3-SAT, understood as a function of the order (...
EWSN
2006
Springer
14 years 4 months ago
2006
Springer
Abstract. Coverage is a very important issue in wireless sensor networks. Current literature defines a point to be covered if it is within the sensing radius of at least one sensor...
ECSQARU
2009
Springer
13 years 11 months ago
2009
Springer
To explore the Perturb and Combine idea for estimating probability densities, we study mixtures of tree structured Markov networks derived by bagging combined with the Chow and Liu...