146 search results - page 14 / 30 » The Complexity of Integer Bound Propagation |
148
Voted
IJCAI
2007
15 years 5 months ago
2007
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
139
click to vote
INFOCOM
2012
IEEE
13 years 6 months ago
2012
IEEE
Abstract—We aim to enhance the end-to-end rate of a general dual-hop relay network with multiple channels and finite modulation formats, by jointly optimizing channel pairing, p...
164
click to vote
STACS
1999
Springer
15 years 8 months ago
1999
Springer
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
158
click to vote
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract— We consider the problem of estimating cascaded aggregates over a matrix presented as a sequence of updates in a data stream. A cascaded aggregate P ◦Q is defined by ...
137
click to vote
COCOA
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...