Sciweavers

11565 search results - page 1930 / 2313
» Computing Minimal Mappings
Sort
View
ICNP
2005
IEEE
16 years 14 days ago
Shape Shifting Tries for Faster IP Route Lookup
Some of the fastest practical algorithms for IP route lookup are based on space-efficient encodings of multi-bit tries [1, 2]. Unfortunately, the time required by these algorithm...
Haoyu Song, Jonathan S. Turner, John W. Lockwood
171
Voted
ICPADS
2005
IEEE
16 years 14 days ago
Universal Routing in Distributed Networks
We show that universal routing can be achieved with low overhead in distributed networks. The validity of our results rests on a new network called the fat-stack. We show that fro...
Kevin F. Chen, Edwin Hsing-Mean Sha, Bin Xiao
175
Voted
IEEEPACT
2005
IEEE
16 years 14 days ago
Extended Whole Program Paths
We describe the design, generation and compression of the extended whole program path (eWPP) representation that not only captures the control flow history of a program execution...
Sriraman Tallam, Rajiv Gupta, Xiangyu Zhang
177
Voted
ISORC
2005
IEEE
16 years 13 days ago
Placement Solutions for Multiple Versions of A Multimedia Object
Transcoding is an important technology which adapts the same multimedia object to diverse mobile appliances; thus, users’ requests for a specified version of a multimedia objec...
Keqiu Li, Hong Shen, Francis Y. L. Chin
194
Voted
ISQED
2005
IEEE
125views Hardware» more  ISQED 2005»
16 years 13 days ago
A New Method for Design of Robust Digital Circuits
As technology continues to scale beyond 100nm, there is a significant increase in performance uncertainty of CMOS logic due to process and environmental variations. Traditional c...
Dinesh Patil, Sunghee Yun, Seung-Jean Kim, Alvin C...
« Prev « First page 1930 / 2313 Last » Next »