Sciweavers

1507 search results - page 102 / 302
» Separating Complexity Classes Using Structural Properties
Sort
View
CVPR
2005
IEEE
15 years 2 days ago
Part-Based Statistical Models for Object Classification and Detection
We propose using simple mixture models to define a set of mid-level binary local features based on binary oriented edge input. The features capture natural local structures in the...
Elliot Joel Bernstein, Yali Amit
EMSOFT
2003
Springer
14 years 3 months ago
Space Reductions for Model Checking Quasi-Cyclic Systems
Despite significant research on state-space reductions, the poor scalability of model checking for reasoning about behavioral models of large, complex systems remains the chief ob...
Matthew B. Dwyer, Robby, Xianghua Deng, John Hatcl...
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
14 years 4 months ago
The computational complexity of nash equilibria in concisely represented games
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
Grant Schoenebeck, Salil P. Vadhan
MST
2007
167views more  MST 2007»
13 years 9 months ago
The Complexity of Polynomial-Time Approximation
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
Liming Cai, Michael R. Fellows, David W. Juedes, F...
COCOON
2007
Springer
14 years 4 months ago
Connected Coloring Completion for General Graphs: Algorithms and Complexity
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
Benny Chor, Michael R. Fellows, Mark A. Ragan, Igo...