Sciweavers

993 search results - page 11 / 199
» The Complexity of Probabilistic EL
Sort
View
DCC
2008
IEEE
15 years 11 months ago
Probabilistic algorithm for finding roots of linearized polynomials
A probabilistic algorithm is presented for finding a basis of the root space of a linearized polynomial L(x) = t i=0 Lixqi over Fqn . The expected time complexity of the presented ...
Vitaly Skachek, Ron M. Roth
90
Voted
STACS
2001
Springer
15 years 4 months ago
Small PCPs with Low Query Complexity
Most known constructions of probabilistically checkable proofs (PCPs) either blow up the proof size by a large polynomial, or have a high (though constant) query complexity. In thi...
Prahladh Harsha, Madhu Sudan
ISLPED
2004
ACM
153views Hardware» more  ISLPED 2004»
15 years 5 months ago
Any-time probabilistic switching model using bayesian networks
Modeling and estimation of switching activities remain to be important problems in low-power design and fault analysis. A probabilistic Bayesian Network based switching model can ...
Shiva Shankar Ramani, Sanjukta Bhanja
IPL
2008
78views more  IPL 2008»
14 years 11 months ago
Resource-bounded measure on probabilistic classes
We extend Lutz's resource-bounded measure to probabilistic classes, and obtain notions of resource-bounded measure on probabilistic complexity classes such as BPE and BPEXP. ...
Philippe Moser
ENTCS
2007
98views more  ENTCS 2007»
14 years 11 months ago
Evaluating Complex MAC Protocols for Sensor Networks with APMC
In this paper we present an analysis of a MAC (Medium Access Control) protocol for wireless sensor networks. The purpose of this protocol is to manage wireless media access by con...
Michaël Cadilhac, Thomas Hérault, Rich...