Sciweavers

598 search results - page 44 / 120
» Procedure Based Program Compression
Sort
View
AAAI
1993
13 years 11 months ago
Model Simplification by Asymptotic Order of Magnitude Reasoning
One of the hardest problems in reasoning about a physical system is finding an approximate model that is mathematically tractable and yet captures the essence of the problem. Appr...
Kenneth Man-kam Yip
ICIP
2000
IEEE
14 years 11 months ago
Hierarchical Representation and Coding of Surfaces Using 3D Polygon Meshes
This paper presents a novel procedure for the representation and coding of 3D surfaces using hierarchical adaptive triangulation. The proposed procedure is based on pyramidal anal...
Ioannis Kompatsiaris, Michael G. Strintzis
CORR
2006
Springer
119views Education» more  CORR 2006»
13 years 9 months ago
Calculating modules in contextual logic program refinement
The refinement calculus for logic programs is a framework for deriving logic programs from specifications. It is based on a wide-spectrum language that can express both specificat...
Robert Colvin, Ian J. Hayes, Paul A. Strooper
MCS
2008
Springer
13 years 9 months ago
Dynamical low-rank approximation: applications and numerical experiments
Dynamical low-rank approximation is a differential-equation based approach to efficiently computing low-rank approximations to time-dependent large data matrices or to solutions o...
Achim Nonnenmacher, Christian Lubich
CCGRID
2003
IEEE
14 years 2 months ago
Programming for Dependability in a Service-based Grid
Service-based Grid infrastructures emphasize service composition rather than sharing of low level resources. The idea is to build Grid applications out of computational services p...
Win Bausch, Cesare Pautasso, Gustavo Alonso