13603 search results - page 272 / 2721 » On the Complexity of Computing Treelength |
160
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
Aggregating the judgments of a group of agents regarding a set of interdependent propositions can lead to inconsistent outcomes. One of the parameters involved is the agenda, the ...
156
click to vote
CGF
2008
15 years 6 months ago
2008
The accurate generation of soft shadows is a particularly computationally intensive task. In order to reduce rendering time, most real-time and offline applications decorrelate th...
164
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; ind...
166
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We relate the notion of matroid pathwidth to the minimum trellis state-complexity (which we term trellis-width) of a linear code, and to the pathwidth of a graph. By reducing from ...
129
click to vote
TSP
2008
15 years 5 months ago
2008
We present a reduced-complexity soft detection (RCSD) scheme geared to multiple-input multiple-output (MIMO) systems with spatial domain multiplexing leading to layered space-time ...