Sciweavers

903 search results - page 89 / 181
» On the reduction of a random basis
Sort
View
LPAR
2010
Springer
15 years 4 months ago
The Complexity of Partial-Observation Parity Games
We consider two-player zero-sum games on graphs. On the basis of the information available to the players these games can be classified as follows: (a) partial-observation (both p...
Krishnendu Chatterjee, Laurent Doyen
CTRSA
2011
Springer
243views Cryptology» more  CTRSA 2011»
14 years 9 months ago
Better Key Sizes (and Attacks) for LWE-Based Encryption
We analyze the concrete security and key sizes of theoretically sound lattice-based encryption schemes based on the “learning with errors” (LWE) problem. Our main contribution...
Richard Lindner, Chris Peikert
ACMACE
2008
ACM
15 years 8 months ago
Dimensionality reduced HRTFs: a comparative study
Dimensionality reduction is a statistical tool commonly used to map high-dimensional data into lower a dimensionality. The transformed data is typically more suitable for regressi...
Bill Kapralos, Nathan Mekuz, Agnieszka Kopinska, S...
SC
2003
ACM
15 years 11 months ago
Handling Heterogeneity in Shared-Disk File Systems
We develop and evaluate a system for load management in shared-disk file systems built on clusters of heterogeneous computers. The system generalizes load balancing and server pr...
Changxun Wu, Randal C. Burns
CRYPTO
2003
Springer
124views Cryptology» more  CRYPTO 2003»
15 years 11 months ago
Primality Proving via One Round in ECPP and One Iteration in AKS
On August 2002, Agrawal, Kayal and Saxena announced the first deterministic and polynomial time primality testing algorithm. For an input n, the AKS algorithm runs in heuristic t...
Qi Cheng