Sciweavers

41 search results - page 5 / 9
» Compact routing with name independence
Sort
View
FCCM
2004
IEEE
107views VLSI» more  FCCM 2004»
15 years 5 months ago
An Alternate Wire Database for Xilinx FPGAs
This paper presents ADB, an Alternate Wire Database, suitable for routing, tracing, and browsing in Xilinx Virtex, Virtex-E, Virtex-II, and Virtex-II Pro FPGAs. While mainstream d...
Neil Steiner, Peter M. Athanas
SODA
2001
ACM
110views Algorithms» more  SODA 2001»
15 years 2 months ago
IMproved results for route planning in stochastic transportation
In the bus network problem, the goal is to generate a plan for getting from point X to point Y within a city using buses in the smallest expected time. Because bus arrival times a...
Justin A. Boyan, Michael Mitzenmacher
CRYPTO
2010
Springer
188views Cryptology» more  CRYPTO 2010»
15 years 2 months ago
i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits
Homomorphic encryption (HE) schemes enable computing functions on encrypted data, by means of a public Eval procedure that can be applied to ciphertexts. But the evaluated ciphert...
Craig Gentry, Shai Halevi, Vinod Vaikuntanathan
ICDE
1999
IEEE
143views Database» more  ICDE 1999»
16 years 2 months ago
Query Routing in Large-Scale Digital Library Systems
Modern digital libraries require user-friendly and yet responsive access to the rapidly growing, heterogeneous, and distributed collection of information sources. However, the inc...
Ling Liu
IPCCC
2006
IEEE
15 years 7 months ago
BGP with an adaptive minimal route advertisement interval
The duration of the Minimal Route Advertisement Interval (MRAI) and the implementation of MRAI timers have a significant influence on the convergence time of the Border Gateway Pr...
Nenad Laskovic, Ljiljana Trajkovic