Sciweavers

43 search results - page 1 / 9
» The Elimination of Nesting in SPCF
Sort
View
TLCA
2005
Springer
13 years 9 months ago
The Elimination of Nesting in SPCF
We use a fully abstract denotational model to show that nested function calls and recursive definitions can be eliminated from SPCF (a typed functional language with simple non-lo...
James Laird
FOCS
2010
IEEE
13 years 2 months ago
Solving Linear Systems through Nested Dissection
Abstract--The generalized nested dissection method, developed by Lipton, Rose, and Tarjan, is a seminal method for solving a linear system Ax = b where A is a symmetric positive de...
Noga Alon, Raphael Yuster
VR
2010
IEEE
167views Virtual Reality» more  VR 2010»
13 years 2 months ago
Dynamic control of multiple focal-plane projections for eliminating defocus and occlusion
This paper presents a novel dynamic control of multiple focal-plane projections. Our approach multiplexes the projectors’ focal-planes so that all the displayed images are focus...
Momoyo Nagase, Daisuke Iwai, Kosuke Sato
SIAMSC
2010
142views more  SIAMSC 2010»
12 years 11 months ago
Hypergraph-Based Unsymmetric Nested Dissection Ordering for Sparse LU Factorization
In this paper we present HUND, a hypergraph-based unsymmetric nested dissection ordering algorithm for reducing the fill-in incurred during Gaussian elimination. HUND has several i...
Laura Grigori, Erik G. Boman, Simplice Donfack, Ti...
SAC
2002
ACM
13 years 4 months ago
Automatic code generation for executing tiled nested loops onto parallel architectures
This paper presents a novel approach for the problem of generating tiled code for nested for-loops using a tiling transformation. Tiling or supernode transformation has been widel...
Georgios I. Goumas, Maria Athanasaki, Nectarios Ko...