Sciweavers

2957 search results - page 506 / 592
» The Complexity of Polynomial-Time Approximation
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
APVIS
2010
13 years 9 months ago
Physically-based interactive schlieren flow visualization
Understanding fluid flow is a difficult problem and of increasing importance as computational fluid dynamics produces an abundance of simulation data. Experimental flow analysis h...
Carson Brownlee, Vincent Pegoraro, Singer Shankar,...
DIMVA
2010
13 years 9 months ago
Evaluating Bluetooth as a Medium for Botnet Command and Control
Abstract. Malware targeting mobile phones is being studied with increasing interest by the research community. While such attention has previously focused on viruses and worms, man...
Kapil Singh, Samrit Sangal, Nehil Jain, Patrick Tr...
ICMLA
2007
13 years 9 months ago
Scalable optimal linear representation for face and object recognition
Optimal Component Analysis (OCA) is a linear method for feature extraction and dimension reduction. It has been widely used in many applications such as face and object recognitio...
Yiming Wu, Xiuwen Liu, Washington Mio
NIPS
2008
13 years 9 months ago
Bayesian Kernel Shaping for Learning Control
In kernel-based regression learning, optimizing each kernel individually is useful when the data density, curvature of regression surfaces (or decision boundaries) or magnitude of...
Jo-Anne Ting, Mrinal Kalakrishnan, Sethu Vijayakum...