Sciweavers

2020 search results - page 70 / 404
» Speeding up Slicing
Sort
View
ICFP
2010
ACM
13 years 11 months ago
Regular, shape-polymorphic, parallel arrays in Haskell
We present a novel approach to regular, multi-dimensional arrays in Haskell. The main highlights of our approach are that it (1) is purely functional, (2) supports reuse through s...
Gabriele Keller, Manuel M. T. Chakravarty, Roman L...
CAL
2006
13 years 10 months ago
A Case for Compressing Traces with BDDs
Instruction-level traces are widely used for program and hardware analysis. However, program traces for just a few seconds of execution are enormous, up to several terabytes in siz...
Graham D. Price, Manish Vachharajani
IJSI
2008
109views more  IJSI 2008»
13 years 10 months ago
Modular Church-Rosser Modulo: The Complete Picture
In [19], Toyama proved that the union of two confluent term-rewriting systems that share absolutely no function symbols or constants is likewise confluent, a property called modula...
Jean-Pierre Jouannaud, Yoshihito Toyama
CORR
2007
Springer
105views Education» more  CORR 2007»
13 years 10 months ago
Empirical Evaluation of Four Tensor Decomposition Algorithms
Higher-order tensor decompositions are analogous to the familiar Singular Value Decomposition (SVD), but they transcend the limitations of matrices (second-order tensors). SVD is ...
Peter D. Turney
TOG
2008
70views more  TOG 2008»
13 years 10 months ago
Space-time surface reconstruction using incompressible flow
We introduce a volumetric space-time technique for the reconstruction of moving and deforming objects from point data. The output of our method is a four-dimensional space-time so...
Andrei Sharf, Dan A. Alcantara, Thomas Lewiner, Ch...