123 search results - page 7 / 25 » Complexity of Boolean Functions on PRAMs - Lower Bound Techn... |
TCAD
2010
13 years 2 months ago
2010
Abstract--Functional verification is one of the major bottlenecks in system-on-chip design due to the combined effects of increasing complexity and lack of automated techniques for...
JMLR
2002
13 years 7 months ago
2002
Recently, sample complexity bounds have been derived for problems involving linear functions such as neural networks and support vector machines. In many of these theoretical stud...
POPL
2009
ACM
14 years 8 months ago
2009
ACM
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...
ICPR
2010
IEEE
13 years 11 months ago
2010
IEEE
Using Boolean AND and OR functions to combine the responses of multiple one- or two-class classifiers in the ROC space may significantly improve performance of a detection system o...
STACS
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. We compare classical and quantum query complexities of total Boolean functions. It is known that for worst-case complexity, the gap between quantum and classical can be a...