Sciweavers

10146 search results - page 73 / 2030
» Fast FAST
Sort
View
COMPUTING
2006
112views more  COMPUTING 2006»
13 years 10 months ago
Fast Summation of Radial Functions on the Sphere
Radial functions are a powerful tool in many areas of multidimensional approximation, especially when dealing with scattered data. We present a fast approximate algorithm for the ...
Jens Keiner, Stefan Kunis, Daniel Potts
JMLR
2006
124views more  JMLR 2006»
13 years 10 months ago
Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problem
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
Tijl De Bie, Nello Cristianini
IJON
2007
119views more  IJON 2007»
13 years 10 months ago
Finite sample effects of the fast ICA algorithm
Many algorithms for independent component analysis (ICA) and blind source separation (BSS) can be considered particular instances of a criterion based on the sum of two terms: C(Y...
Sergio Bermejo
TCAD
2008
119views more  TCAD 2008»
13 years 10 months ago
FLUTE: Fast Lookup Table Based Rectilinear Steiner Minimal Tree Algorithm for VLSI Design
Abstract-- In this paper, we present a very fast and accurate rectilinear Steiner minimal tree (RSMT) algorithm called FLUTE. FLUTE is based on pre-computed lookup table to make RS...
Chris C. N. Chu, Yiu-Chung Wong
KAIS
2000
106views more  KAIS 2000»
13 years 10 months ago
FANNC: A Fast Adaptive Neural Network Classifier
In this paper, a fast adaptive neural network classifier named FANNC is proposed. FANNC exploits the advantages of both adaptive resonance theory and field theory. It needs only on...
Zhi-Hua Zhou, Shifu Chen, Zhaoqian Chen