3020 search results - page 6 / 604 » Optimal partition trees |
WG
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
86
Voted
INFOCOM
2006
IEEE
15 years 5 months ago
2006
IEEE
— For many wireless communication links, such as those employing turbo codes or sequentially-decoded convolutional codes, the power consumption of the decoder at the receiver dep...
100
click to vote
DAM
2007
14 years 11 months ago
2007
The packing chromatic number χρ(G) of a graph G is the smallest integer k such that the vertex set of G can be partitioned into packings with pairwise different widths. Several...
102
click to vote
DBPL
2007
Springer
15 years 5 months ago
2007
Springer
Macro tree transducers (mtt) are an important model that both covers many useful XML transformations and allows decidable exact typechecking. This paper reports our first step tow...
84
Voted
ECSQARU
2003
Springer
15 years 4 months ago
2003
Springer
Abstract. Binary join trees have been a popular structure to compute the impact of multiple belief functions initially assigned to nodes of trees or networks. Shenoy has proposed t...