Sciweavers

117 search results - page 9 / 24
» Routing on Trees via Matchings
Sort
View
JUCS
2007
112views more  JUCS 2007»
14 years 9 months ago
Internet Path Behavior Prediction via Data Mining: Conceptual Framework and Case Study
: In this paper we propose an application of data mining methods in the prediction of the availability and performance of Internet paths. We deploy a general decision-making method...
Leszek Borzemski
FOCS
2003
IEEE
15 years 2 months ago
Switch Scheduling via Randomized Edge Coloring
The essence of an Internet router is an n ¡ n switch which routes packets from input to output ports. Such a switch can be viewed as a bipartite graph with the input and output p...
Gagan Aggarwal, Rajeev Motwani, Devavrat Shah, An ...
INFOCOM
2009
IEEE
15 years 4 months ago
Scalar Prefix Search: A New Route Lookup Algorithm for Next Generation Internet
Currently, the increasing rate of routing lookups in Internet routers, the large number of prefixes and also the transition from IPV4 to IPV6, have caused Internet designers to pro...
Mohammad Behdadfar, Hossein Saidi, Hamid Alaei, Ba...
73
Voted
ICPR
2008
IEEE
15 years 4 months ago
Understanding vehicle motion via spatial integration of intensities
On a moving vehicle, speedy motion extraction from video is demanded. Different from the traditional motion estimation methods that track or match 2D features in consecutive motio...
Jiang Yu Zheng, Yasaswy Bhupalam, Hiromi T. Tanaka
82
Voted
DAC
1997
ACM
15 years 1 months ago
More Practical Bounded-Skew Clock Routing
: Academic clock routing research results has often had limited impact on industry practice, since such practical considerations as hierarchical buffering, rise-time and overshoot ...
Andrew B. Kahng, Chung-Wen Albert Tsao