9842 search results - page 328 / 1969 » The Complexity of the Matching-Cut Problem |
133
click to vote
JCSS
2002
15 years 3 months ago
2002
The exact complexity of the weak pigeonhole principle is an old and fundamental problem in proof complexity. Using a diagonalization argument, Paris, Wilkieand Woods 16] showed ho...
148
click to vote
TIT
1998
15 years 3 months ago
1998
—We review the principles of Minimum Description Length and Stochastic Complexity as used in data compression and statistical modeling. Stochastic complexity is formulated as the...
141
click to vote
MP
2007
15 years 3 months ago
2007
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adve...
115
click to vote
TSP
2010
14 years 10 months ago
2010
Developing computational models paves the way to understanding, predicting, and influencing the long-term behavior of genomic regulatory systems. However, several major challenges ...
136
click to vote
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
Localization and classification of acoustic signals in a complex auditory scene is an every day task of the human auditory system. However, this problem presents a significant c...