Sciweavers

635 search results - page 100 / 127
» Some Computational Problems Related to Pseudo-intents
Sort
View
ICALP
2005
Springer
15 years 11 months ago
Completely Non-malleable Schemes
Abstract An encryption scheme is non-malleable if the adversary cannot transform a ciphertext into one of a related message under the given public key. Although providing a very st...
Marc Fischlin
IPTPS
2003
Springer
15 years 11 months ago
SplitStream: High-Bandwidth Content Distribution in Cooperative Environments
In tree-based multicast systems, a relatively small number of interior nodes carry the load of forwarding multicast messages. This works well when the interior nodes are dedicated...
Miguel Castro, Peter Druschel, Anne-Marie Kermarre...
FGR
2000
IEEE
200views Biometrics» more  FGR 2000»
15 years 10 months ago
The Global Dimensionality of Face Space
Low-dimensional representations of sensory signals are key to solving many of the computational problems encountered in high-level vision. Principal Component Analysis (PCA) has b...
Penio S. Penev, Lawrence Sirovich
COLT
2000
Springer
15 years 10 months ago
Model Selection and Error Estimation
We study model selection strategies based on penalized empirical loss minimization. We point out a tight relationship between error estimation and data-based complexity penalizatio...
Peter L. Bartlett, Stéphane Boucheron, G&aa...
IJCAI
2001
15 years 7 months ago
Genetic Algorithm based Selective Neural Network Ensemble
Neural network ensemble is a learning paradigm where several neural networks are jointly used to solve a problem. In this paper, the relationship between the generalization abilit...
Zhi-Hua Zhou, Jianxin Wu, Yuan Jiang, Shifu Chen