Sciweavers

107 search results - page 21 / 22
» Some Applications of Bounds for Designs to the Cryptography
Sort
View
JSAC
2010
131views more  JSAC 2010»
13 years 5 months ago
BGP Add-Paths: The Scaling/Performance Tradeoffs
— Internet Service Providers design their network with resiliency in mind, having multiple paths towards external IP subnets available at the borders of their network. However, w...
Virginie Van den Schrieck, Pierre François,...
ICDE
2000
IEEE
158views Database» more  ICDE 2000»
14 years 8 months ago
The DC-Tree: A Fully Dynamic Index Structure for Data Warehouses
: Many companies have recognized the strategic importance of the knowledge hidden in their large databases and have built data warehouses. Typically, updates are collected and appl...
Hans-Peter Kriegel, Jörn Kohlhammer, Martin E...
SPAA
2004
ACM
14 years 23 days ago
Online algorithms for prefetching and caching on parallel disks
Parallel disks provide a cost effective way of speeding up I/Os in applications that work with large amounts of data. The main challenge is to achieve as much parallelism as poss...
Rahul Shah, Peter J. Varman, Jeffrey Scott Vitter
CHES
1999
Springer
133views Cryptology» more  CHES 1999»
13 years 11 months ago
Random Number Generators Founded on Signal and Information Theory
The strength of a cryptographic function depends on the amount of entropy in the cryptovariables that are used as keys. Using a large key length with a strong algorithm is false co...
David Paul Maher, Robert J. Rance
GD
1998
Springer
13 years 11 months ago
Drawing Large Graphs with H3Viewer and Site Manager
We demonstrate the H3Viewer graph drawing library, which can be run from a standalone program or in conjunction with other programs such as SGI's Site Manager application. Our...
Tamara Munzner