Sciweavers

6365 search results - page 124 / 1273
» Fast Local Computation Algorithms
Sort
View
ICMLA
2003
15 years 6 months ago
Fast Class-Attribute Interdependence Maximization (CAIM) Discretization Algorithm
– Discretization is a process of converting a continuous attribute into an attribute that contains small number of distinct values. One of the major reasons for discretizing an a...
Lukasz A. Kurgan, Krzysztof J. Cios
VLSID
2005
IEEE
100views VLSI» more  VLSID 2005»
16 years 5 months ago
A Fast Buffered Routing Tree Construction Algorithm under Accurate Delay Model
Buffer insertion method plays a great role in modern VLSI design. Many buffer insertion algorithms have been proposed in recent years. However, most of them used simplified delay ...
Yibo Wang, Yici Cai, Xianlong Hong
GECCO
2000
Springer
250views Optimization» more  GECCO 2000»
15 years 8 months ago
A Simple and Fast GA-SA hybrid Image Segmentation Algorithm
Image segmentation is an important process of image analysis. Most of the published approaches for image segmentation need to set appropriate parameter values to cope with the unc...
Shinn-Ying Ho, Kual-Zheng Lee
TIP
2008
104views more  TIP 2008»
15 years 4 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
148
Voted
ITNG
2010
IEEE
15 years 10 months ago
A Fast and Stable Incremental Clustering Algorithm
— Clustering is a pivotal building block in many data mining applications and in machine learning in general. Most clustering algorithms in the literature pertain to off-line (or...
Steven Young, Itamar Arel, Thomas P. Karnowski, De...