18 search results - page 1 / 4 » Compact data structure and scalable algorithms for the spars... |
PPOPP
2011
ACM
12 years 7 months ago
2011
ACM
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...
SC
2009
ACM
13 years 9 months ago
2009
ACM
It has been shown that the sparse grid combination technique can be a practical tool to solve high dimensional PDEs arising in multidimensional option pricing problems in finance...
PPOPP
2010
ACM
14 years 1 months ago
2010
ACM
Many large-scale parallel programs follow a bulk synchronous parallel (BSP) structure with distinct computation and communication phases. Although the communication phase in such ...
GIS
2008
ACM
13 years 5 months ago
2008
ACM
Bintrees based on longest edge bisection and hierarchies of diamonds are popular multiresolution techniques on regularly sampled terrain datasets. In this work, we consider sparse...
ICPP
2000
IEEE
13 years 8 months ago
2000
IEEE
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...