Sciweavers

536 search results - page 76 / 108
» Some Lower Bounds for the Complexity of Continuation Methods
Sort
View
ICMCS
2009
IEEE
107views Multimedia» more  ICMCS 2009»
13 years 6 months ago
Fast directional image interpolation with difference projection
This paper presents a new directional image interpolator, aiming to increase image resolution with high perceptual quality and low computational complexity. In our method, missing...
Zhiwei Xiong, Yonghua Zhang, Xiaoyan Sun, Feng Wu
CVPR
2008
IEEE
14 years 3 months ago
Fast kernel learning for spatial pyramid matching
Spatial pyramid matching (SPM) is a simple yet effective approach to compute similarity between images. Similarity kernels at different regions and scales are usually fused by som...
Junfeng He, Shih-Fu Chang, Lexing Xie
CRYPTO
2007
Springer
149views Cryptology» more  CRYPTO 2007»
14 years 13 days ago
Hash Functions and the (Amplified) Boomerang Attack
Abstract. Since Crypto 2004, hash functions have been the target of many attacks which showed that several well-known functions such as SHA-0 or MD5 can no longer be considered sec...
Antoine Joux, Thomas Peyrin
TOG
2008
85views more  TOG 2008»
13 years 8 months ago
Robust treatment of simultaneous collisions
Robust treatment of complex collisions is a challenging problem in cloth simulation. Some state of the art methods resolve collisions iteratively, invoking a fail-safe when a boun...
David Harmon, Etienne Vouga, Rasmus Tamstorf, Eita...
GECCO
2006
Springer
151views Optimization» more  GECCO 2006»
14 years 4 days ago
Sporadic model building for efficiency enhancement of hierarchical BOA
This paper describes and analyzes sporadic model building, which can be used to enhance the efficiency of the hierarchical Bayesian optimization algorithm (hBOA) and other advance...
Martin Pelikan, Kumara Sastry, David E. Goldberg