Sciweavers

6251 search results - page 290 / 1251
» Randomness, Computability, and Density
Sort
View
KDD
2006
ACM
136views Data Mining» more  KDD 2006»
16 years 7 months ago
Very sparse random projections
There has been considerable interest in random projections, an approximate algorithm for estimating distances between pairs of points in a high-dimensional vector space. Let A Rn...
Ping Li, Trevor Hastie, Kenneth Ward Church
ISSAC
2007
Springer
130views Mathematics» more  ISSAC 2007»
16 years 23 days ago
On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms
Algebraic randomization techniques can be applied to hybrid symbolic-numeric algorithms. Here we consider the problem of interpolating a sparse rational function from noisy values...
Erich Kaltofen, Zhengfeng Yang, Lihong Zhi
ISSTA
2006
ACM
16 years 18 days ago
Object distance and its application to adaptive random testing of object-oriented programs
Testing with random inputs can give surprisingly good results if the distribution of inputs is spread out evenly over the input domain; this is the intuition behind Adaptive Rando...
Ilinca Ciupa, Andreas Leitner, Manuel Oriol, Bertr...
169
Voted
CORR
2010
Springer
128views Education» more  CORR 2010»
15 years 6 months ago
Random Oracles in a Quantum World
Once quantum computers reach maturity most of today's traditional cryptographic schemes based on RSA or discrete logarithms become vulnerable to quantum-based attacks. Hence, ...
Özgür Dagdelen, Marc Fischlin, Anja Lehm...
CC
2007
Springer
108views System Software» more  CC 2007»
15 years 6 months ago
Communication vs. Computation
We initiate a study of tradeoffs between communication and computation in well-known communication models and in other related models. The fundamental question we investigate is t...
Prahladh Harsha, Yuval Ishai, Joe Kilian, Kobbi Ni...