. The central idea is that rather than modeling the heap as a single total function from addresses (integers) to integers, we model the heap as a collection of partial functions with disjoint domains. We call each such partial function a linear map. Programmers may select objects from linear maps, update linear

Abstract not found

The Go-Go immersive interaction technique uses the metaphor of interactively growing the user's arm and non-linear mapping for reaching and manipulating distant objects. Unlike others, our technique allows for seamless direct manipulation of both nearby objects and those at a distance.

We prove that the set of all reflectance functions (the mapping from surface normals to intensities) produced by Lambertian objects under distant, isotropic lighting lies close to a 9D linear subspace. This implies that, in general, the set of images of a convex Lambertian object obtained under a

In this paper, we deal with compact linear mappings of a normed linear space, within the framework of Bishop's constructive mathematics. We prove the constructive substitutes for the classically well-known theorems on compact linear mappings: T is compact if and only if T * is compact

We present a new polynomial-time algorithm for linear programming. In the worst case, the algorithm requires O(tf'SL) arithmetic operations on O(L) bit numbers, where n is the number of variables and L is the number of bits in the input. The running,time of this algorithm is better than

The support-vector network is a new learning machine for two-group classification problems. The machine conceptually implements the following idea: input vectors are non-linearly mapped to a very high-dimension feature space. In this feature space a linear decision surface is constructed. Special

Summary. We show that a central linear mapping of a projectively embedded Euclidean n-space onto a projectively embedded Euclidean m-space is decomposable into a central projection followed by a similarity if, and only if, the least singular value of a certain matrix has multiplicity ≥ 2m − n + 1

In this paper we fully describe all tropical linear mappings in the tropical projective plane TP 2, that is, maps from the tropical plane to itself given by tropical multiplication by a 3 × 3 matrix A with entries in T. First we will allow only real entries in the matrix A and, only at the end

This paper presents a complete analytical characterization of a large class of central and non-central imaging devices dubbed linear cameras by Ponce [9]. Pajdla [7] has shown that a subset of these, the oblique cameras, can be modelled by a certain type of linear map. We give here a full