Sciweavers

40 search results - page 5 / 8
» Preferred direction Steiner trees
Sort
View
GLVLSI
2000
IEEE
145views VLSI» more  GLVLSI 2000»
13 years 10 months ago
Manhattan or non-Manhattan?: a study of alternative VLSI routing architectures
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...
Cheng-Kok Koh, Patrick H. Madden
INFOCOM
2010
IEEE
13 years 4 months ago
Deploying Mesh Nodes under Non-Uniform Propagation
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...
Joshua Robinson, Mohit Singh, Ram Swaminathan, Edw...
APPROX
2008
Springer
134views Algorithms» more  APPROX 2008»
13 years 7 months ago
Inapproximability of Survivable Networks
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...
Yuval Lando, Zeev Nutov
INFOCOM
2005
IEEE
13 years 11 months ago
Achieving minimum-cost multicast: a decentralized approach based on network coding
— We present decentralized algorithms that compute minimum-cost subgraphs for establishing multicast connections in networks that use coding. These algorithms, coupled with exist...
Desmond S. Lun, Niranjan Ratnakar, Ralf Koetter, M...
NAACL
2010
13 years 3 months ago
An Efficient Algorithm for Easy-First Non-Directional Dependency Parsing
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...
Yoav Goldberg, Michael Elhadad