608 search results - page 50 / 122 » On Dependent Randomized Rounding Algorithms |
CHES
1999
Springer
14 years 1 months ago
1999
Springer
The strength of a cryptographic function depends on the amount of entropy in the cryptovariables that are used as keys. Using a large key length with a strong algorithm is false co...
ATAL
2007
Springer
14 years 3 months ago
2007
Springer
Activity recognition is a key component for creating intelligent, multi-agent systems. Intrinsically, activity recognition is a temporal classification problem. In this paper, we...
CIKM
2005
Springer
14 years 2 months ago
2005
Springer
It has long been recognized that capturing term relationships is an important aspect of information retrieval. Even with large amounts of data, we usually only have significant ev...
CVPR
2009
IEEE
15 years 4 months ago
2009
IEEE
We present a new approach to robust pose-variant face
recognition, which exhibits excellent generalization ability
even across completely different datasets due to its weak
depe...
IJCAI
2007
13 years 10 months ago
2007
Many methods, including supervised and unsupervised algorithms, have been developed for extractive document summarization. Most supervised methods consider the summarization task ...