13603 search results - page 377 / 2721 » On the Computational Complexity of Cut-Reduction |
191
click to vote
STACS
2010
Springer
16 years 2 months ago
2010
Springer
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
185
click to vote
ATAL
2009
Springer
16 years 2 months ago
2009
Springer
Knockout tournaments constitute a common format of sporting events, and also model a specific type of election scheme (namely, sequential pairwise elimination election). In such ...
201
click to vote
COMPLEX
2009
Springer
16 years 2 months ago
2009
Springer
In this article we evaluate an epidemic algorithm for the synchronization of coupled Kuramoto oscillators in complex Peer-to-Peer topologies. The algorithm requires a periodic coup...
192
Voted
TAMC
2009
Springer
16 years 2 months ago
2009
Springer
In this paper we define the notion of an f(k)-uniform parameterized exponential time scheme. We show that a problem can be solved in parameterized O(2o(f(k)) p(n)) time if and on...
202
click to vote
ICIP
2006
IEEE
16 years 1 months ago
2006
IEEE
Rate control is a complicated problem in the H.264/AVC coding standard, extra computation is usually needed for the existing rate control schemes to estimate the complexity of fra...