Sciweavers

130 search results - page 14 / 26
» Solving Dense Linear Systems on Graphics Processors
Sort
View
PG
2003
IEEE
15 years 4 months ago
Bounding Recursive Procedural Models Using Convex Optimization
We present an algorithm to construct a tight bounding polyhedron for a recursive procedural model. We first use an iterated function system (IFS) to represent the extent of the p...
Orion Sky Lawlor, John C. Hart
CASES
2003
ACM
15 years 2 months ago
Efficient spill code for SDRAM
Processors such as StrongARM and memory such as SDRAM enable efficient execution of multiple loads and stores in a single instruction. This is particularly useful in connection wi...
V. Krishna Nandivada, Jens Palsberg
STOC
1990
ACM
95views Algorithms» more  STOC 1990»
15 years 2 months ago
Separators in Two and Three Dimensions
a 3-dimensions a separator size where is the ber of 3-simplexes in and is the number of ization of the separator results for planar graphs, such as the and Tarjan planar separator...
Gary L. Miller, William P. Thurston
AUTOMATICA
2006
142views more  AUTOMATICA 2006»
14 years 10 months ago
Stability regions in the parameter space: D-decomposition revisited
The challenging problem in linear control theory is to describe the total set of parameters (controller coefficients or plant characteristics) which provide stability of a system....
Elena N. Gryazina, Boris T. Polyak
CGF
2010
99views more  CGF 2010»
14 years 10 months ago
Trivial Connections on Discrete Surfaces
This paper presents a straightforward algorithm for constructing connections on discrete surfaces that are as smooth as possible everywhere but on a set of isolated singularities ...
Keenan Crane, Mathieu Desbrun, Peter Schröder