Sciweavers

8825 search results - page 35 / 1765
» All for one or one for all
Sort
View
FSE
2008
Springer
162views Cryptology» more  FSE 2008»
13 years 9 months ago
Collisions on SHA-0 in One Hour
At Crypto 2007, Joux and Peyrin showed that the boomerang attack, a classical tool in block cipher cryptanalysis, can also be very useful when analyzing hash functions. They applie...
Stéphane Manuel, Thomas Peyrin
PRL
2002
146views more  PRL 2002»
13 years 7 months ago
Face recognition with one training image per person
: Recently, a method called (PC)2 A was proposed to deal with face recognition with one training image per person. As an extension of the standard eigenface technique, (PC)2 A comb...
Jianxin Wu, Zhi-Hua Zhou
CN
1998
78views more  CN 1998»
13 years 7 months ago
Twenty-One: Cross-Language Disclosure and Retrieval of Multimedia Documents on Sustainable Development
The Twenty-One project brings together environmental organisations, technology providers and research institutes from several European countries. The main objective of the project...
Wilco G. ter Stal, J.-H. Beijert, G. de Bruin, J. ...
JDA
2008
84views more  JDA 2008»
13 years 7 months ago
Red-blue covering problems and the consecutive ones property
Set Cover problems are of core importance in many applications. In recent research, the "red-blue variants" where blue elements all need to be covered whereas red elemen...
Michael Dom, Jiong Guo, Rolf Niedermeier, Sebastia...
STOC
2001
ACM
159views Algorithms» more  STOC 2001»
14 years 8 months ago
Optimal static range reporting in one dimension
We consider static one dimensional range searching problems. These problems are to build static data structures for an integer set S U, where U = {0, 1, . . . , 2w - 1}, which su...
Stephen Alstrup, Gerth Stølting Brodal, The...