Sciweavers

3466 search results - page 181 / 694
» Fast computation of special resultants
Sort
View
BROADNETS
2007
IEEE
16 years 29 days ago
Scheduling routing table calculations to achieve fast convergence in OSPF protocol
Fast convergence to topology changes is a key requirement in modern routing infrastructure while reducing the protocol CPU overhead continues to be as important as before. In this...
Mukul Goyal, Weigao Xie, Mohd Soperi, Seyed H. Hos...
CVPR
2006
IEEE
16 years 20 days ago
Fast Compact City Modeling for Navigation Pre-Visualization
Nowadays, GPS-based car navigation systems mainly use speech and aerial views of simplified road maps to guide drivers to their destination. However, drivers often experience dif...
Nico Cornelis, Kurt Cornelis, Luc J. Van Gool
PPOPP
2006
ACM
16 years 17 days ago
Fast and transparent recovery for continuous availability of cluster-based servers
Recently there has been renewed interest in building reliable servers that support continuous application operation. Besides maintaining system state consistent after a failure, o...
Rosalia Christodoulopoulou, Kaloian Manassiev, Ang...
IPPS
2005
IEEE
16 years 6 days ago
Security-Driven Heuristics and A Fast Genetic Algorithm for Trusted Grid Job Scheduling
In this paper, our contributions are two-fold: First, we enhance the Min-Min and Sufferage heuristics under three risk modes driven by security concerns. Second, we propose a new ...
Shanshan Song, Yu-Kwong Kwok, Kai Hwang
DAC
2004
ACM
16 years 1 days ago
Extending the transaction level modeling approach for fast communication architecture exploration
System-on-Chip (SoC) designs are increasingly becoming more complex. Efficient on-chip communication architectures are critical for achieving desired performance in these systems....
Sudeep Pasricha, Nikil D. Dutt, Mohamed Ben-Romdha...