209 search results - page 30 / 42 » The Computational Complexity of Weak Saddles |
109
click to vote
SPAA
2003
ACM
15 years 7 months ago
2003
ACM
The increasing application space of interconnection networks now encompasses several applications, such as packet routing and I/O interconnect, where the throughput of a routing a...
112
Voted
DAGM
2003
Springer
15 years 7 months ago
2003
Springer
Recently Viola et al. have introduced a rapid object detection scheme based on a boosted cascade of simple feature classifiers. In this paper we introduce and empirically analysis ...
100
Voted
ICDCSW
2002
IEEE
15 years 6 months ago
2002
IEEE
The middleware technology used as the foundation of Internet-enabled enterprise systems is becoming increasingly complex. In addition, the various technologies offer a number of s...
144
Voted
FOCS
1999
IEEE
15 years 6 months ago
1999
IEEE
This paper is concerned with the complexity of proofs and of searching for proofs in two propositional proof systems: Resolution and Polynomial Calculus (PC). For the former syste...
116
click to vote
STACS
1994
Springer
15 years 5 months ago
1994
Springer
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...