Sciweavers

1802 search results - page 244 / 361
» Sparse Computations with PEI
Sort
View
105
Voted
SC
1994
ACM
15 years 5 months ago
A parallel formulation of interior point algorithms
In recent years, interior point algorithms have been used successfully for solving mediumto large-size linear programming LP problems. In this paper we describe a highly parallel ...
George Karypis, Anshul Gupta, Vipin Kumar
SC
1995
ACM
15 years 5 months ago
Parallel Implementations of the Power System Transient Stability Problem on Clusters of Workstations
Power system transient stability analysis computes the response of the rapidly changing electrical components of a power system to a sequence of large disturbances followed by ope...
Monika ten Bruggencate, Suresh Chalasani
SGP
2004
15 years 4 months ago
Laplacian Surface Editing
Surface editing operations commonly require geometric details of the surface to be preserved as much as possible. We argue that geometric detail is an intrinsic property of a surf...
Olga Sorkine, Daniel Cohen-Or, Yaron Lipman, Marc ...
113
Voted
NIPS
2007
15 years 3 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
EUROGRAPHICS
2010
Eurographics
15 years 2 months ago
Fast and Efficient Skinning of Animated Meshes
Skinning is a simple yet popular deformation technique combining compact storage with efficient hardware accelerated rendering. While skinned meshes (such as virtual characters) a...
Ladislav Kavan, Peter-Pike Sloan, Carol O'Sullivan