Sciweavers

2252 search results - page 425 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
ICDCS
2000
IEEE
15 years 7 months ago
Scheduling Heuristics for Data Requests in an Oversubscribed Network with Priorities and Deadlines
Providing up-to-date input to users’ applications is an important data management problem for a distributed computing environment, where each data storage location and intermedi...
Mitchell D. Theys, Noah Beck, Howard Jay Siegel, M...
151
Voted
ICDCS
2000
IEEE
15 years 7 months ago
An Adaptive, Perception-Driven Error Spreading Scheme in Continuous Media Streaming
For transmission of continuous media (CM) streams such as audio and video over the Internet, a critical issue is that periodic network overloads cause bursty packet losses. Studie...
Srivatsan Varadarajan, Hung Q. Ngo, Jaideep Srivas...
129
Voted
CHES
1999
Springer
133views Cryptology» more  CHES 1999»
15 years 6 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
158
Voted
ICPADS
1994
IEEE
15 years 6 months ago
Stochastic Modeling of Scaled Parallel Programs
Testingthe performance scalabilityof parallelprograms can be a time consuming task, involving many performance runs for different computer configurations, processor numbers, and p...
Allen D. Malony, Vassilis Mertsiotakis, Andreas Qu...
154
Voted
CCS
2006
ACM
15 years 6 months ago
Finding the original point set hidden among chaff
In biometric identification, a fingerprint is typically represented as a set of minutiae which are 2D points. A method [4] to protect the fingerprint template hides the minutiae b...
Ee-Chien Chang, Ren Shen, Francis Weijian Teo