Sciweavers

666 search results - page 79 / 134
» New primal-dual algorithms for Steiner tree problems
Sort
View
ICIP
2003
IEEE
14 years 10 months ago
Inverse halftoning by decision tree learning
Inverse halftoning is the process to retrieve a (gray) continuous-tone image from a halftone. Recently, machinelearning-based inverse halftoning techniques have been proposed. Dec...
Hae Yong Kim, Ricardo L. de Queiroz
TAMC
2010
Springer
13 years 7 months ago
Two-Layer Planarization Parameterized by Feedback Edge Set
Abstract. Given an undirected graph G and an integer k ≥ 0, the NPhard 2-Layer Planarization problem asks whether G can be transformed into a forest of caterpillar trees by remov...
Johannes Uhlmann, Mathias Weller
IPPS
2008
IEEE
14 years 3 months ago
Junction tree decomposition for parallel exact inference
We present a junction tree decomposition based algorithm for parallel exact inference. This is a novel parallel exact inference method for evidence propagation in an arbitrary jun...
Yinglong Xia, Viktor K. Prasanna
SWAT
1992
Springer
147views Algorithms» more  SWAT 1992»
14 years 1 months ago
Efficient Rebalancing of Chromatic Search Trees
In PODS'91, Nurmi and Soisalon-Soininen presented a new type of binary search tree for databases, which they call a chromatic tree. The aim is to improve runtime performance ...
Joan Boyar, Kim S. Larsen
TIT
2008
74views more  TIT 2008»
13 years 9 months ago
Optimal Parsing Trees for Run-Length Coding of Biased Data
Abstract-- We study coding schemes which encode unconstrained sequences into run-length-limited (d, k)-constrained sequences. We present a general framework for the construction of...
Sharon Aviran, Paul H. Siegel, Jack K. Wolf