Sciweavers

4843 search results - page 447 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
ICCAD
2006
IEEE
126views Hardware» more  ICCAD 2006»
16 years 1 months ago
Optimizing yield in global routing
We present the first efficient approach to global routing that takes spacing-dependent costs into account and provably finds a near-optimum solution including these costs. We sh...
Dirk Müller
155
Voted
CISS
2008
IEEE
15 years 11 months ago
Optimizing wireless networks for heterogeneous spatial loads
—Large-scale wireless networks must be designed such that there are no gaps in coverage. It is also desirable to minimize the number of access points used in order to minimize th...
Balaji Rengarajan, Gustavo de Veciana
GLOBECOM
2008
IEEE
15 years 11 months ago
Near-Optimum Power Allocation for Outage Restricted Distributed MIMO Multi-Hop Networks
Abstract—The throughput of multi-hop communication systems can significantly be increased by the application of MIMO concepts. To utilize the physical resources in an efficient...
Dirk Wübben, Yidong Lang
ICASSP
2008
IEEE
15 years 11 months ago
Maximum entropy relaxation for multiscale graphical model selection
We consider the problem of learning multiscale graphical models. Given a collection of variables along with covariance specifications for these variables, we introduce hidden var...
Myung Jin Choi, Venkat Chandrasekaran, Alan S. Wil...
ICCCN
2008
IEEE
15 years 11 months ago
A Distributed Routing Algorithm for Networks with Data-Path Services
Abstract—Many next-generation Internet architectures propose advanced packet processing functions in the data path of the network. Such “services” are typically performed on ...
Xin Huang, Sivakumar Ganapathy, Tilman Wolf