Sciweavers

613 search results - page 89 / 123
» Time Optimal Self-Stabilizing Spanning Tree Algorithms
Sort
View
NANONET
2009
Springer
200views Chemistry» more  NANONET 2009»
15 years 4 months ago
Repeater Insertion for Two-Terminal Nets in Three-Dimensional Integrated Circuits
A new approach for inserting repeaters in 3-D interconnects is proposed. The allocation of repeaters along an interplane interconnect is iteratively determined. The proposed approa...
Hu Xu, Vasilis F. Pavlidis, Giovanni De Micheli
TPDS
2010
126views more  TPDS 2010»
14 years 4 months ago
Stabilizing Distributed R-Trees for Peer-to-Peer Content Routing
Publish/subscribe systems provide useful platforms for delivering data (events) from publishers to subscribers in a decoupled fashion. Developing efficient publish/subscribe scheme...
Silvia Bianchi, Pascal Felber, Maria Gradinariu Po...
ICIP
2005
IEEE
15 years 11 months ago
Dependent bit allocation in multiview video coding
We consider the bit allocation problem in multiview video coding (MVC). A dependent coding technique using trellis expansion and the Viterbi algorithm (VA) is proposed, which take...
Jae Hoon Kim, Jonathan Garcia, Antonio Ortega
FOCS
2003
IEEE
15 years 3 months ago
Breaking a Time-and-Space Barrier in Constructing Full-Text Indices
Suffix trees and suffix arrays are the most prominent full-text indices, and their construction algorithms are well studied. In the literature, the fastest algorithm runs in O(n...
Wing-Kai Hon, Kunihiko Sadakane, Wing-Kin Sung
ALENEX
2009
106views Algorithms» more  ALENEX 2009»
14 years 11 months ago
Drawing Binary Tanglegrams: An Experimental Evaluation
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
Martin Nöllenburg, Markus Völker, Alexan...