Sciweavers

209 search results - page 30 / 42
» The Computational Complexity of Weak Saddles
Sort
View
SPAA
2003
ACM
14 years 22 days ago
Throughput-centric routing algorithm design
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...
Brian Towles, William J. Dally, Stephen P. Boyd
DAGM
2003
Springer
14 years 21 days ago
Empirical Analysis of Detection Cascades of Boosted Classifiers for Rapid Object Detection
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 ...
Rainer Lienhart, Alexander Kuranov, Vadim Pisarevs...
ICDCSW
2002
IEEE
14 years 13 days ago
Behavior and Performance of Message-Oriented Middleware Systems
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...
Phong Tran, Paul Greenfield, Ian Gorton
FOCS
1999
IEEE
13 years 11 months ago
A Study of Proof Search Algorithms for Resolution and Polynomial Calculus
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...
Maria Luisa Bonet, Nicola Galesi
STACS
1994
Springer
13 years 11 months ago
Reachability and the Power of Local Ordering
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...
Kousha Etessami, Neil Immerman