1089 search results - page 11 / 218 » Randomness and Reducibility |
CORR
2011
Springer
12 years 11 months ago
2011
Springer
In this paper, we study methods for improving the utility and privacy of reputation scores for online auctions, such as used in eBay, so as to reduce the effectiveness of feedbac...
ICCAD
2004
IEEE
14 years 4 months ago
2004
IEEE
9, IO]. However, unlike the case with static timing, it is not so easy We show how recent advances in the handling of correlated interval representations of range uncertainty can b...
FSTTCS
1992
Springer
13 years 11 months ago
1992
Springer
In this paper we study the consequences of the existence of sparse hard sets for NP and other complexity classes under certain types of deterministic, randomized, and nondetermini...
PKDD
2004
Springer
14 years 1 months ago
2004
Springer
We show how carefully crafted random matrices can achieve distance-preserving dimensionality reduction, accelerate spectral computations, and reduce the sample complexity of certai...
COMPGEOM
2008
ACM
13 years 9 months ago
2008
ACM
The Johnson-Lindenstrauss random projection lemma gives a simple way to reduce the dimensionality of a set of points while approximately preserving their pairwise distances. The m...