Sciweavers

1768 search results - page 304 / 354
» Optimal routing in Chord
Sort
View
IWCMC
2006
ACM
15 years 5 months ago
Modeling key agreement in multi-hop ad hoc networks
Securing multicast communications in ad hoc networks has become one of the most challenging research directions in the areas of wireless networking and security. This is especiall...
Giovanni Di Crescenzo, Maria Striki, John S. Baras
INFOCOM
2005
IEEE
15 years 5 months ago
Network localization in partially localizable networks
— Knowing the positions of the nodes in a network is essential to many next generation pervasive and sensor network functionalities. Although many network localization systems ha...
David Kiyoshi Goldenberg, Arvind Krishnamurthy, W....
ISQED
2005
IEEE
81views Hardware» more  ISQED 2005»
15 years 5 months ago
Exact Algorithms for Coupling Capacitance Minimization by Adding One Metal Layer
Due to the rapid development of manufacturing process technology and tight marketing schedule, the chip design and manufacturing always work toward an integrated solution to achie...
Hua Xiang, Kai-Yuan Chao, Martin D. F. Wong
ISPD
2005
ACM
174views Hardware» more  ISPD 2005»
15 years 5 months ago
Fast and accurate rectilinear steiner minimal tree algorithm for VLSI design
In this paper, we present a very fast and accurate rectilinear Steiner minimal tree (RSMT)1 algorithm called FLUTE. The algorithm is an extension of the wirelength estimation appr...
Chris C. N. Chu, Yiu-Chung Wong
WAOA
2005
Springer
177views Algorithms» more  WAOA 2005»
15 years 5 months ago
Approximation and Complexity of k-Splittable Flows
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
Ronald Koch, Martin Skutella, Ines Spenke