Sciweavers

237 search results - page 29 / 48
» Approximation Algorithms for Minimum Tree Partition
Sort
View
IPPS
1998
IEEE
14 years 26 days ago
Multicasting and Broadcasting in Large WDM Networks
We address the issue of multicasting and broadcasting in wide area WDM networks in which a source broadcasts a message to all members in S V. We formalize it as the optimal multi...
Weifa Liang, Hong Shen
ISPD
1997
ACM
186views Hardware» more  ISPD 1997»
14 years 24 days ago
EWA: exact wiring-sizing algorithm
The wire sizing problem under inequality Elmore delay constraints is known to be posynomial, hence convex under an exponential variable-transformation. There are formal methods fo...
Rony Kay, Gennady Bucheuv, Lawrence T. Pileggi
ICIP
2001
IEEE
14 years 10 months ago
Coding theoretic approach to image segmentation
This paper introduces multi-scale tree-based approaches to image segmentation, using Rissanen's coding theoretic minimum description length (MDL) principle to penalize overly...
Mário A. T. Figueiredo, Robert D. Nowak, Un...
EGPGV
2004
Springer
181views Visualization» more  EGPGV 2004»
14 years 2 months ago
Parallel Multiresolution Volume Rendering of Large Data Sets with Error-Guided Load Balancing
We present a new parallel multiresolution volume rendering algorithm for visualizing large data sets. Using the wavelet transform, the raw data is first converted into a multires...
Chaoli Wang, Jinzhu Gao, Han-Wei Shen
ISAAC
2004
Springer
137views Algorithms» more  ISAAC 2004»
14 years 2 months ago
The Polymatroid Steiner Problems
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
Gruia Calinescu, Alexander Zelikovsky