57 search results - page 4 / 12 » Convergence and Rate of Convergence of a Manifold-Based Dime... |
CAGD
2007
13 years 5 months ago
2007
We present an algorithm which is able to compute all roots of a given univariate polynomial within a given interval. In each step, we use degree reduction to generate a strip boun...
ICASSP
2011
IEEE
12 years 9 months ago
2011
IEEE
In this paper, a novel algorithm for bandwidth reduction in adaptive distributed learning is introduced. We deal with diffusion networks, in which the nodes cooperate with each ot...
SIGGRAPH
1996
ACM
13 years 9 months ago
1996
ACM
Antialiased pixel values are often computed as the mean of N point samples. Using uniformly distributed random samples, the central limit theorem predicts a variance of the mean o...
IDA
1998
Springer
13 years 5 months ago
1998
Springer
A fast and simple algorithm for approximately calculating the principal components (PCs) of a data set and so reducing its dimensionality is described. This Simple Principal Compo...
ICML
2007
IEEE
14 years 6 months ago
2007
IEEE
Intuitively, learning should be easier when the data points lie on a low-dimensional submanifold of the input space. Recently there has been a growing interest in algorithms that ...