Sciweavers

28 search results - page 5 / 6
» High dimensional polynomial interpolation on sparse grids
Sort
View
NIPS
2007
13 years 9 months ago
What makes some POMDP problems easy to approximate?
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
David Hsu, Wee Sun Lee, Nan Rong
VIS
2004
IEEE
218views Visualization» more  VIS 2004»
14 years 8 months ago
Pixel-Exact Rendering of Spacetime Finite Element Solutions
Computational simulation of time-varying physical processes is of fundamental importance for many scientific and engineering applications. Most frequently, time-varying simulation...
Michael Garland, Robert Haber, Yuan Zhou
ICPP
2000
IEEE
13 years 12 months ago
A Scalable Parallel Subspace Clustering Algorithm for Massive Data Sets
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. ...
Harsha S. Nagesh, Sanjay Goil, Alok N. Choudhary
VISUALIZATION
2005
IEEE
14 years 1 months ago
Surface Reconstruction Via Contour Metamorphosis: An Eulerian Approach With Lagrangian Particle Tracking
We present a robust method for 3D reconstruction of closed surfaces from sparsely sampled parallel contours. A solution to this problem is especially important for medical segment...
Ola Nilsson, David E. Breen, Ken Museth
SIAMSC
2008
140views more  SIAMSC 2008»
13 years 7 months ago
Newton-GMRES Preconditioning for Discontinuous Galerkin Discretizations of the Navier--Stokes Equations
We study preconditioners for the iterative solution of the linear systems arising in the implicit time integration of the compressible Navier-Stokes equations. The spatial discreti...
Per-Olof Persson, Jaime Peraire