Sciweavers

206 search results - page 20 / 42
» Efficient adaptive collect using randomization
Sort
View
EUROCRYPT
2000
Springer
14 years 7 days ago
Using Hash Functions as a Hedge against Chosen Ciphertext Attack
The cryptosystem recently proposed by Cramer and Shoup [CS98] is a practical public key cryptosystem that is secure against adaptive chosen ciphertext attack provided the Decision...
Victor Shoup
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 8 months ago
Privacy-Preserving Protocols for Eigenvector Computation
Abstract. In this paper, we present a protocol for computing the principal eigenvector of a collection of data matrices belonging to multiple semi-honest parties with privacy const...
Manas A. Pathak, Bhiksha Raj
TPDS
2002
136views more  TPDS 2002»
13 years 8 months ago
Automatic Partitioning of Parallel Loops with Parallelepiped-Shaped Tiles
In this paper, an efficient algorithm to implement loop partitioning is introduced and evaluated. We start from results of Agarwal et al. [1] whose aim is to minimize the number of...
Fabrice Rastello, Yves Robert
KDD
2007
ACM
190views Data Mining» more  KDD 2007»
14 years 9 months ago
Model-shared subspace boosting for multi-label classification
Typical approaches to multi-label classification problem require learning an independent classifier for every label from all the examples and features. This can become a computati...
Rong Yan, Jelena Tesic, John R. Smith
MODELS
2007
Springer
14 years 2 months ago
Using Domain-Specific Modeling to Generate User Interfaces for Wizards
The rising adoption and incorporation of computers into everyday life requires human-computer interaction methods to be efficient and easy to understand. Simultaneously, complexit...
Enis Afgan, Jeffrey G. Gray, Purushotham Bangalore