Sciweavers

334 search results - page 42 / 67
» Practical Parallel Algorithms for Minimum Spanning Trees
Sort
View
ISPA
2007
Springer
15 years 3 months ago
Channel Assignment and Spatial Reuse Scheduling to Improve Throughput and Enhance Fairness in Wireless Mesh Networks
In wireless mesh network, by equipped mesh router with multiple radios tuned into orthogonal channels, throughput improvement problem can be alleviated. Efficient channel assignmen...
Nguyen H. Tran, Choong Seon Hong
ICCAD
2008
IEEE
170views Hardware» more  ICCAD 2008»
15 years 6 months ago
A polynomial time approximation scheme for timing constrained minimum cost layer assignment
Abstract— As VLSI technology enters the nanoscale regime, interconnect delay becomes the bottleneck of circuit performance. Compared to gate delays, wires are becoming increasing...
Shiyan Hu, Zhuo Li, Charles J. Alpert
ICCAD
2001
IEEE
84views Hardware» more  ICCAD 2001»
15 years 6 months ago
Minimum-Buffered Routing of Non-Critical Nets for Slew Rate and Reliability Control
In high-speed digital VLSI design, bounding the load capacitance at gate outputs is a well-known methodology to improve coupling noise immunity, reduce degradation of signal trans...
Charles J. Alpert, Andrew B. Kahng, Bao Liu, Ion I...
68
Voted
WINET
2008
86views more  WINET 2008»
14 years 9 months ago
Relay sensor placement in wireless sensor networks
This paper addresses the following relay sensor placement problem: given the set of duty sensors in the plane and the upper bound of the transmission range, compute the minimum nu...
Xiuzhen Cheng, Ding-Zhu Du, Lusheng Wang, Baogang ...
JUCS
2010
117views more  JUCS 2010»
14 years 8 months ago
NP-completeness and FPT Results for Rectilinear Covering Problems
Abstract: This paper discusses three rectilinear (that is, axis-parallel) covering problems in d dimensions and their variants. The first problem is the Rectilinear Line Cover whe...
Vladimir Estivill-Castro, Apichat Heednacram, Fran...