Sciweavers

1957 search results - page 138 / 392
» Approximate algorithms for neural-Bayesian approaches
Sort
View
ICCAD
2006
IEEE
133views Hardware» more  ICCAD 2006»
15 years 6 months ago
Stable and compact inductance modeling of 3-D interconnect structures
Recent successful techniques for the efficient simulation of largescale interconnect models rely on the sparsification of the inverse of the inductance matrix L. While there are...
Hong Li, Venkataramanan Balakrishnan, Cheng-Kok Ko...
GLOBECOM
2010
IEEE
14 years 8 months ago
Approximation Ratios of Multicast Light-Trees in WDM Networks
Abstract--All-optical multicast routing (AOMR) is implemented by the concept of light-tree in WDM networks. The costoptimal multicast light-tree is NP-hard to compute, especially w...
Fen Zhou, Miklós Molnár, Bernard Cou...
JSAC
2006
79views more  JSAC 2006»
14 years 10 months ago
Layered Multicast Rate Control Based on Lagrangian Relaxation and Dynamic Programming
In this paper, we address the rate control problem for layered multicast traffic, with the objective of solving a generalized throughput/fairness objective. Our approach is based o...
Koushik Kar, Leandros Tassiulas
CORR
2010
Springer
107views Education» more  CORR 2010»
14 years 8 months ago
Maximum Betweenness Centrality: Approximability and Tractable Cases
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
Martin Fink, Joachim Spoerhase
ICCD
2003
IEEE
109views Hardware» more  ICCD 2003»
15 years 6 months ago
Independent Test Sequence Compaction through Integer Programming
We discuss the compaction of independent test sequences for sequential circuits. Our first contribution is the formulation of this problem as an integer program, which we then so...
Petros Drineas, Yiorgos Makris