This paper presents an iterative algorithm for approximating gray-scale images with adaptive triangular meshes ensuring a given tolerance. At each iteration, the algorithm applies a non-iterative adaptive meshing technique. In this way, this technique converges faster than traditional mesh refinement algorithms. The performance of the proposed technique is studied in terms of compression ratio ...

Approximate Generalized Inverses with Iterative Refinement for $\epsilon$-Accurate Preconditioning of Singular Systems

Over the years a lot of work has been done on the topic of grammatical picture generation. However, most often such work has disregarded the pragmatic problems of combining different grammatical devices to achieve more complex results and implementing them in an efficient manner. This master’s thesis aims to establish notions and results that make it possible to consider and deal with such issu...

Why Read This Chapter? To be introduced to a more formal “computer-science” style of simulation design, especially suited to simulations of multi-level systems (e.g. firms, departments, and people). Abstract This chapter is an introduction to a more formal approach to designing agent-based simulations of organisations (in the widest sense). The basic method is the iterative refinement of struct...

ion-Based Interaction Model for Synthesis Hila Peleg, Shachar Itzhaky, and Sharon Shoham 1 Technion, {hilap,shachari}@cs.technion.ac.il 2 Tel Aviv University, [email protected] Abstract. Program synthesis is the problem of computing from a specification Program synthesis is the problem of computing from a specification a program that implements it. New and popular variations on the synthe...

In this paper we propose a strategy for generating consistent hierarchical T–meshes which allow local refinement and offer a way to obtain spline basis functions with highest order smoothness incrementally. We describe the required ordering of line–segments during refinement and the construction of spline basis functions. We give our strategy for generating consistent hierarchical T–meshes over...

In hardware-aware high performance computing, blockasynchronous iteration and mixed precision iterative refinement are two techniques that are applied to leverage the computing power of SIMD accelerators like GPUs. Although they use a very different approach for this purpose, they share the basic idea of compensating the convergence behaviour of an inferior numerical algorithm by a more efficie...

In the solution of a system of linear algebraic equations Ax = b with a large sparse coefficient matrix A, the LU-decomposition with iterative refinement (LUIR) is compared with the LU-decomposition with direct solution (LUDS), which is without iterative refinement. We verify by numerical experiments that the use of sparse matrix techniques with LUIR may result in a reduction of both the comput...

We present a technique for drawing ornamental designs consisting of placed instances of simple shapes. These shapes, which we call elements, are selected from a small library of templates. The elements are deformed to flow along a direction field interpolated from user-supplied strokes, giving a sense of visual flow to the final composition, and constrained to lie within a container region. Our...

This paper describes a method of parallel scheduling of planning and action to realize an efficient and reactive robotic system in dynamic environments. The method uses a partial planning result, which comes from an iterative refinement planning, to determine feasible actions to be executed in parallel with the planning process. The method is applied to a multiple-camera multiple-person trackin...