Sciweavers

11 search results - page 1 / 3
» Sparse Grids, Adaptivity, and Symmetry
Sort
View
COMPUTING
2006
119views more  COMPUTING 2006»
13 years 4 months ago
Sparse Grids, Adaptivity, and Symmetry
Sparse grid methods represent a powerful and efficient technique for the representation and approximation of functions and particularly the solutions of partial differential equat...
Harry Yserentant
ICCS
2007
Springer
13 years 8 months ago
Adaptive Sparse Grid Classification Using Grid Environments
Common techniques tackling the task of classification in data mining employ ansatz functions associated to training data points to fit the data as well as possible. Instead, the fe...
Dirk Pflüger, Ioan Lucian Muntean, Hans-Joach...
IPPS
1999
IEEE
13 years 9 months ago
An Object-Oriented Environment for Sparse Parallel Computation on Adaptive Grids
Many numerical solutions of large scale simulation models require finer discretizations in some regions of the computational grid. When this region is not known in advance, adapti...
Salvatore Filippone, Michele Colajanni, Dario Pasc...
NECO
2008
114views more  NECO 2008»
13 years 4 months ago
A Sparse Generative Model of V1 Simple Cells with Intrinsic Plasticity
Current models for the learning of feature detectors work on two time scales: on a fast time scale the internal neurons' activations adapt to the current stimulus; on a slow ...
Cornelius Weber, Jochen Triesch
AAECC
2007
Springer
87views Algorithms» more  AAECC 2007»
13 years 4 months ago
Towards an accurate performance modeling of parallel sparse factorization
We present a simulation-based performance model to analyze a parallel sparse LU factorization algorithm on modern cached-based, high-end parallel architectures. We consider supern...
Laura Grigori, Xiaoye S. Li