Sciweavers

923 search results - page 113 / 185
» On the Topology of Discrete Strategies
Sort
View
SIAMSC
2010
118views more  SIAMSC 2010»
13 years 4 months ago
Optimal Explicit Strong-Stability-Preserving General Linear Methods
This paper constructs strong-stability-preserving general linear time-stepping methods that are well suited for hyperbolic PDEs discretized by the method of lines. These methods ge...
Emil M. Constantinescu, Adrian Sandu
TIT
2010
300views Education» more  TIT 2010»
13 years 4 months ago
Polar codes are optimal for lossy source coding
We consider lossy source compression of a binary symmetric source using polar codes and the low-complexity successive encoding algorithm. It was recently shown by Arikan that polar...
Satish Babu Korada, Rüdiger L. Urbanke
VLSID
2002
IEEE
160views VLSI» more  VLSID 2002»
14 years 9 months ago
An Efficient Hierarchical Timing-Driven Steiner Tree Algorithm for Global Routing
In this paper, we propose a hierarchical timing-driven Steiner tree algorithm for global routing which considers the minimization of timing delay during the tree construction as t...
Jingyu Xu, Xianlong Hong, Tong Jing, Yici Cai, Jun...
ICC
2009
IEEE
129views Communications» more  ICC 2009»
14 years 4 months ago
Do Next Generation Networks Need Path Diversity?
—We have currently reached a phase where big shifts in the network traffic might impose to rethink the design of current architectures, and where new technologies, being pushed ...
Luca Muscariello, Diego Perino, Dario Rossi
ICC
2007
IEEE
14 years 3 months ago
Multi-MetaRing Protocol: Fairness in Optical Packet Ring Networks
— We focus on Metropolitan Area Networks operating in packet mode and exploiting a single-hop wavelength division multiplexing (WDM) architecture. First, we briefly describe a s...
Andrea Bianco, Davide Cuda, Jorge M. Finochietto, ...