681 search results - page 5 / 137 » General Polynomial Time Decomposition Algorithms |
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
A great deal of interest has been paid to the estimation of time-varying autoregressive (TVAR) parameters. However, when the observations are disturbed by an additive white measur...
TALG
2010
14 years 7 months ago
2010
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...
CP
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
SODA
2000
ACM
14 years 11 months ago
2000
ACM
This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with ...
LICS
2010
IEEE
14 years 7 months ago
2010
IEEE
We prove that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. That is, for every class C of graphs such that some graph H is...