Sciweavers

3946 search results - page 683 / 790
» The computational complexity of choice sets
Sort
View
TFS
2008
90views more  TFS 2008»
15 years 6 months ago
Fuzzy Interpolation and Extrapolation: A Practical Approach
Fuzzy interpolation does not only help to reduce the complexity of fuzzy models, but also makes inference in sparse rule-based systems possible. It has been successfully applied to...
Zhiheng Huang, Qiang Shen
TIP
2008
104views more  TIP 2008»
15 years 6 months ago
A Fast Thresholded Landweber Algorithm for Wavelet-Regularized Multidimensional Deconvolution
We present a fast variational deconvolution algorithm that minimizes a quadratic data term subject to a regularization on the 1 -norm of the wavelet coefficients of the solution. ...
Cédric Vonesch, Michael Unser
TIP
2008
219views more  TIP 2008»
15 years 6 months ago
Binary Partition Trees for Object Detection
This paper discusses the use of Binary Partition Trees (BPTs) for object detection. BPTs are hierarchical region-based representations of images. They define a reduced set of regio...
Verónica Vilaplana, Ferran Marqués, ...
TNN
2008
138views more  TNN 2008»
15 years 6 months ago
A Fast and Scalable Recurrent Neural Network Based on Stochastic Meta Descent
This brief presents an efficient and scalable online learning algorithm for recurrent neural networks (RNNs). The approach is based on the real-time recurrent learning (RTRL) algor...
Zhenzhen Liu, Itamar Elhanany
JCST
2007
97views more  JCST 2007»
15 years 6 months ago
Improved Collision Attack on Hash Function MD5
In this paper, we present a fast attack algorithm to find two-block collision of hash function MD5. The algorithm is based on the two-block collision differential path of MD5 that ...
Jie Liang, Xue-Jia Lai