Sciweavers

113 search results - page 7 / 23
» Trunk decomposition based global routing optimization
Sort
View
ICPR
2008
IEEE
14 years 5 months ago
Semi-supervised marginal discriminant analysis based on QR decomposition
In this paper, a novel subspace learning method, semi-supervised marginal discriminant analysis (SMDA), is proposed for classification. SMDA aims at maintaining the intrinsic neig...
Rui Xiao, Pengfei Shi
DAC
2007
ACM
14 years 12 months ago
An Integer Linear Programming Based Routing Algorithm for Flip-Chip Design
The flip-chip package provides a high chip-density solution to the demand for more I/O pads of VLSI designs. In this paper, we present the first routing algorithm in the literatur...
Jia-Wei Fang, Chin-Hsiung Hsu, Yao-Wen Chang
CONEXT
2007
ACM
14 years 2 months ago
Rethinking internet traffic management: from multiple decompositions to a practical protocol
In the Internet today, traffic management spans congestion control (at end hosts), routing protocols (on routers), and traffic engineering (by network operators). Historically, th...
Jiayue He, Martin Suchara, Ma'ayan Bresler, Jennif...
GLOBECOM
2008
IEEE
14 years 5 months ago
Distributed Base Station Cooperation via Block-Diagonalization and Dual-Decomposition
Abstract—It has been recently shown that base station cooperation may yield great capacity improvement in downlink multiple antenna cellular networks. However, the proposed solut...
Yosia Hadisusanto, Lars Thiele, Volker Jungnickel
ICNP
2007
IEEE
14 years 5 months ago
Lexicographic products in metarouting
— Routing protocols often keep track of multiple route metrics, where some metrics are more important than others. Route selection is then based on lexicographic comparison: the ...
Alexander J. T. Gurney, Timothy G. Griffin