Sciweavers

14403 search results - page 65 / 2881
» Dynamical Systems Trees
Sort
View
ISPD
2000
ACM
108views Hardware» more  ISPD 2000»
14 years 2 months ago
A hybrid dynamic/quadratic programming algorithm for interconnect tree optimization
In this paper, we present an algorithm for delay minimization of interconnect trees by simultaneous buffer insertion/sizing and wire sizing. The algorithm integrates the quadratic...
Yu-Yen Mo, Chris C. N. Chu
DCC
2005
IEEE
14 years 9 months ago
Coding the Wavelet Spatial Orientation Tree with Low Computational Complexity
ct A very fast, low complexity algorithm for resolution scalable and random access decoding is presented. The algorithm is based on AGP (Alphabet and Group Partitioning) [1], where...
Yushin Cho, Amir Said, William A. Pearlman
STOC
2000
ACM
117views Algorithms» more  STOC 2000»
14 years 2 months ago
Faster suffix tree construction with missing suffix links
Abstract. We consider suffix tree construction for situations with missing suffix links. Two examples of such situations are suffix trees for parameterized strings and suffix trees...
Richard Cole, Ramesh Hariharan
CIC
2006
111views Communications» more  CIC 2006»
13 years 11 months ago
A New Tree-based Tag Anti-collision Protocol for RFID Systems
Abstract-- This paper proposes a tree-based anti-collision protocol for tags in the UHF (ultra high frequency, 300MHz
Sung Hyun Kim, Min Kyo Shin, PooGyeon Park
ICNP
1999
IEEE
14 years 2 months ago
Scaling End-to-End Multicast Transports with a Topologically-Sensitive Group Formation Protocol
While the IP unicast service has proven successful, extending end-to-end adaptation to multicast has been a difficult problem. Unlike the unicast case, multicast protocols must su...
Sylvia Ratnasamy, Steven McCanne