Sciweavers

2374 search results - page 5 / 475
» Fast Distributed Algorithms for Computing Separable Function...
Sort
View
COMPUTING
2006
112views more  COMPUTING 2006»
13 years 7 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
DAC
2004
ACM
14 years 8 months ago
Fast statistical timing analysis handling arbitrary delay correlations
CT An efficient statistical timing analysis algorithm that can handle arbitrary (spatial and structural) causes of delay correlation is described. The algorithm derives the entire ...
Michael Orshansky, Arnab Bandyopadhyay
ISCAS
2005
IEEE
214views Hardware» more  ISCAS 2005»
14 years 1 months ago
Blind separation of statistically independent signals with mixed sub-Gaussian and super-Gaussian probability distributions
— In the context of Independent Component Analysis (ICA), we propose a simple method for online estimation of activation functions in order to blindly separate instantaneous mixt...
Muhammad Tufail, Masahide Abe, Masayuki Kawamata
AAECC
2008
Springer
83views Algorithms» more  AAECC 2008»
13 years 7 months ago
Fast separable factorization and applications
Abstract. In this paper we show that the separable decomposition of a univariate polynomial can be computed in softly optimal time, in terms of the number of arithmetic operations ...
Grégoire Lecerf
DIS
2007
Springer
14 years 1 months ago
Fast NML Computation for Naive Bayes Models
Abstract. The Minimum Description Length (MDL) is an informationtheoretic principle that can be used for model selection and other statistical inference tasks. One way to implement...
Tommi Mononen, Petri Myllymäki