1802 search results - page 256 / 361 » Sparse Computations with PEI |
GECCO
2000
Springer
15 years 5 months ago
2000
Springer
In previous work we showed, by Walsh analysis, that summary statistics such as mean, variance, skew, and higher order statistics can be computed in polynomial time for embedded la...
161
click to vote
ICPP
1995
IEEE
15 years 5 months ago
1995
IEEE
– In this paper we present experiments with a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller gra...
124
click to vote
PDP
1995
IEEE
15 years 5 months ago
1995
IEEE
We investigate the parallel implementation of the diagonal{implicitly iterated Runge{ Kutta (DIIRK) method, an iteration method based on a predictor{corrector scheme. This method ...
97
Voted
CDC
2009
IEEE
15 years 5 months ago
2009
IEEE
Abstract-- Many model order reduction methods for parameterized systems need to construct a projection matrix V which requires computing several moment matrices of the parameterize...
110
click to vote
ICPR
2010
IEEE
15 years 5 months ago
2010
IEEE
This paper proposes a method for computing a quasi-dense set of matching points between three views of a scene. The method takes a sparse set of seed matches between pairs of view...