Sciweavers

198 search results - page 14 / 40
» A practical algorithm for constructing oblivious routing sch...
Sort
View
CIKM
2009
Springer
15 years 6 months ago
Fast and effective histogram construction
Histogram construction or sequence segmentation is a basic task with applications in database systems, information retrieval, and knowledge management. Its aim is to approximate a...
Felix Halim, Panagiotis Karras, Roland H. C. Yap
INFOCOM
2009
IEEE
15 years 6 months ago
Scalable Routing Via Greedy Embedding
Abstract—We investigate the construction of greedy embeddings in polylogarithmic dimensional Euclidian spaces in order to achieve scalable routing through geographic routing. We ...
Cédric Westphal, Guanhong Pei
ISPD
2009
ACM
141views Hardware» more  ISPD 2009»
15 years 6 months ago
A faster approximation scheme for timing driven minimum cost layer assignment
As VLSI technology moves to the 65nm node and beyond, interconnect delay greatly limits the circuit performance. As a critical component in interconnect synthesis, layer assignmen...
Shiyan Hu, Zhuo Li, Charles J. Alpert
AHSWN
2010
130views more  AHSWN 2010»
14 years 11 months ago
How Good is Opportunistic Routing? - A Reality Check under Rayleigh Fading Channels
Considerations of realistic channel dynamics motivate the design of a new breed of opportunistic schemes, such as opportunistic transmission, scheduling and routing. Compared to t...
Rong Zheng, Chengzhi Li
INFOCOM
2007
IEEE
15 years 6 months ago
Routing, Anycast, and Multicast for Mesh and Sensor Networks
Abstract— This paper studies routing schemes and their distributed construction in limited wireless networks, such as sensor or mesh networks. We argue that the connectivity of s...
Roland Flury, Roger Wattenhofer