Sciweavers

301 search results - page 50 / 61
» On bounding the delay of a critical path
Sort
View
GLVLSI
1996
IEEE
125views VLSI» more  GLVLSI 1996»
15 years 10 months ago
Performance-Driven Interconnect Global Routing
In this paper, we propose a global routing algorithm for multi-layer building-block layouts. The algorithm is based on successive ripup and rerouting while satisfying edge capacit...
Dongsheng Wang, Ernest S. Kuh
VTC
2008
IEEE
124views Communications» more  VTC 2008»
16 years 1 months ago
Transmit Diversity for DS-CDMA/MMSE-FDE with Frequency-Domain ICI Cancellation
—Frequency-domain equalization (FDE) based on the minimum mean square error (MMSE) criterion can provide a better bit error rate (BER) performance than rake combining. However, t...
Kazuaki Takeda, Yohei Kojima, Fumiyuki Adachi
IPSN
2005
Springer
16 years 5 days ago
Virtual patrol: a new power conservation design for surveillance using sensor networks
Surveillance has been a typical application of wireless sensor networks. To conduct surveillance of a given area in real life, one can use stationary watch towers, or can also use...
Chao Gui, Prasant Mohapatra
ALGORITHMICA
2005
225views more  ALGORITHMICA 2005»
15 years 6 months ago
Better Alternatives to OSPF Routing
The current standard for intra-domain network routing, Open Shortest Path First (OSPF), suffers from a number of problems--the tunable parameters (the weights) are hard to optimiz...
Jessica H. Fong, Anna C. Gilbert, Sampath Kannan, ...
CORR
2011
Springer
152views Education» more  CORR 2011»
15 years 1 months ago
Topology Discovery of Sparse Random Graphs With Few Participants
We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants. T...
Animashree Anandkumar, Avinatan Hassidim, Jonathan...