55 search results - page 5 / 11 » Convergence Rates for Greedy Algorithms in Reduced Basis Met... |
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
The Markov chain approximation method is an effective and widely used approach for computing optimal values and controls for stochastic systems. It was extended to nonlinear (and p...
TWC
2008
13 years 7 months ago
2008
A novel framework was introduced recently for stochastic routing in wireless multihop networks, whereby each node selects a neighbor to forward a packet according to a probability...
DCOSS
2011
Springer
12 years 7 months ago
2011
Springer
—In many application scenarios sensors need to calculate the average of some local values, e.g. of local measurements. A possible solution is to rely on consensus algorithms. In ...
IDA
1998
Springer
13 years 7 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...
PAMI
2000
13 years 7 months ago
2000
Abstract-- This paper introduces Evolutionary Pursuit (EP) as a novel and adaptive representation method for image encoding and classification. In analogy to projection pursuit met...