1068 search results - page 79 / 214 » For completeness, sublogarithmic space is no space |
DAC
1994
ACM
14 years 26 days ago
1994
ACM
-- In this paper we present a new method for Boolean matching of completely specified Boolean functions. The canonical Generalized Reed-Muller forms are used as a powerful analysis...
FOCS
1990
IEEE
14 years 25 days ago
1990
IEEE
In [Sh92], Adi Shamir proved a complete characterization of the complexity class IP. He showed that when both randomization and interaction are allowed, the proofs that can be ver...
BROADNETS
2004
IEEE
14 years 15 days ago
2004
IEEE
In this paper, we present a framework for the design of minimal power schedulers that satisfy average packet delay bounds for multiple users in a Gaussian wireless broadcast chann...
CAV
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. This paper develops a local reasoning method to check lineartime temporal properties of concurrent programs. In practice, it is often infeasible to model check over the p...
ESANN
2008
13 years 10 months ago
2008
Abstract. This paper discusses a machine learning approach for binary classification problems which satisfies the specific requirements of safety-related applications. The approach...