3006 search results - page 142 / 602 » Dimensionality reduction and generalization |
145
click to vote
LPNMR
2009
Springer
15 years 8 months ago
2009
Springer
Several proposals of the semantics of aggregates are based on different extensions of the stable model semantics, which makes it difficult to compare them. In this note, building ...
107
Voted
EUROCRYPT
1999
Springer
15 years 7 months ago
1999
Springer
We prove the first general and non-trivial lower bound for the number of times a 1-out-of-n Oblivious Transfer of strings of length should be invoked so as to obtain, by an inform...
140
Voted
ASPDAC
2010
ACM
15 years 1 months ago
2010
ACM
The gramian approximation methods have been proposed recently to overcome the high computing costs of classical balanced truncation based reduction methods. But those methods typi...
134
Voted
ASIACRYPT
2003
Springer
15 years 8 months ago
2003
Springer
In this paper, we study some RSA-based semantically secure encryption schemes (IND-CPA) in the standard model. We first derive the exactly tight one-wayness of Rabin-Paillier encr...
101
Voted
ISCAS
2002
IEEE
15 years 8 months ago
2002
IEEE
: In this work, the problem of the computation of the minimum energy per bit required for communicating through deep sub-micron buses at a given bit rate is solved with an explicit...