94 search results - page 10 / 19 » Genericity, Randomness, and Polynomial-Time Approximations |
FOSSACS
2003
Springer
14 years 3 months ago
2003
Springer
rized Verification by Probabilistic Abstraction . . . . . . . . . . . . . . . . 87 Tamarah Arons, Amir Pnueli, Lenore Zuck Genericity and the π-Calculus . . . . . . . . . . . . ....
WEA
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. Mobile users are roaming in a zone of cells in a cellular network system. The probabilities of each user residing in each cell are known, and all probabilities are indepe...
CIARP
2004
Springer
14 years 1 months ago
2004
Springer
In this paper, we derive lower and upper bounds for the probability of error for a linear classifier, where the random vectors representing the underlying classes obey the multivar...
ADHOCNOW
2004
Springer
14 years 3 months ago
2004
Springer
Topology control is the problem of assigning transmission power values to the nodes of an ad hoc network so that the induced graph satisfies some specified property. The most fun...
FOCS
1995
IEEE
14 years 1 months ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...