40 search results - page 5 / 8 » Preferred direction Steiner trees |
GLVLSI
2000
IEEE
15 years 1 months ago
2000
IEEE
Circuit interconnect has become a substantial obstacle in the design of high performance systems. In this paper we explore a new routing paradigm that strikes at the root of the i...
INFOCOM
2010
IEEE
14 years 7 months ago
2010
IEEE
Abstract—Wireless mesh networks are popular as a costeffective means to provide broadband connectivity to large user populations. A mesh network placement provides coverage, such...
APPROX
2008
Springer
14 years 11 months ago
2008
Springer
In the Survivable Network Design Problem (SNDP) one seeks to find a minimum cost subgraph that satisfies prescribed node-connectivity requirements. We give a novel approximation r...
INFOCOM
2005
IEEE
15 years 3 months ago
2005
IEEE
— We present decentralized algorithms that compute minimum-cost subgraphs for establishing multicast connections in networks that use coding. These algorithms, coupled with exist...
120
click to vote
NAACL
2010
14 years 7 months ago
2010
We present a novel deterministic dependency parsing algorithm that attempts to create the easiest arcs in the dependency structure first in a non-directional manner. Traditional d...