We present a unifying framework for studying the solution of multiclass categorization problems by reducing them to multiple binary problems that are then solved using a margin-based binary learning algorithm. The proposed framework unifies some of the most popular approaches in which each class

A technique is presented for global analysie of program structure in order to perform compile time optimization of object code generated for expressions. The global expression optimization presented includes constant propagation, common subexpression elimination, elimination of redundant register load operations, and live expression analysis. A general purpose program flow analysis algorithm is developed which depends upon the existence of an “optimizing function. ” The algorithm is defined formally using a directed graph model of program flow structure, and is shown to be correct, Several optimizing functions are defined which, when used in conjunction with the flow analysis algorithm, provide the various forms of code optimization. The flow analysis algorithm is sufficiently general that additional functions can easily be defined for other forms of globa ~ cod: optimization. 1. INTRODUCTION of the graph represent program control flow Dossi-A number of techniques have evolved for the bilities between the nodes at execution–time. compile-time analysis of program structure in order to locate redundant computations, perform constant

, there is no unified approach to this problem. In this paper, we prove that a queueing network is positive Harris recurrent if the corresponding fluid limit model eventually reaches zero and stays there regardless of the initial system configuration. As an application of the result, we prove that single class networks

We introduce ideas, proposed technologies, and initial results for an office of the future that is based on a unified application of computer vision and computer graphics in a system that combines and builds upon the notions of the CAVE™, tiled display systems, and image-based modeling. The basic

We propose a new unified approach to deal with two formulations of image distortion and a method for estimating the distortion parameters by using the both formulation; So far either of the two formulations has been developed separately. The proposed method is based on image registration

We apply the Skyrme model to dense hadronic matter, which provides a unified approach to high density, valid in the large Nc limit. In our picture, dense hadronic matter is described by the classical soliton configuration with minimum energy for the given baryon number density. By incorporating

an underlying skeleton or a more abstract system of parameters, to displacements in the object local coordinate frames. Once this uniform representation is identified, previously disparate deformation types can be accomplished within a single unified approach. The advantages of this algorithm include improved

Abstract. SIMULA was a language for modeling and programming and provided a unified approach to modeling and programming in contrast to methodologies based on structured analysis and design. The current development seems to be going in the direction of separation of modeling and programming

We present a general framework for solving resource allocation and scheduling problems. Given a resource of fixed size, we present algorithms that approximate the maximum throughput or the minimum loss by a constant factor. Our approximation factors apply to many problems, among which are: (i) real-time scheduling of jobs on parallel machines, (ii) bandwidth allocation for sessions between two endpoints, (iii) general caching, (iv) dynamic storage allocation, and (v) bandwidth allocation on optical line and ring topologies. For some of these problems we provide the first constant factor approximation algorithm. Our algorithms are simple and efficient and are based on the localratio technique. We note that they can equivalently be interpreted within the primal-dual schema.

Using a combination of S-Matrix and perturbative QCD properties in the small xBj regime, we propose a formulation of hard diffraction unifying the partonic (Ingelman-Schlein) Pomeron, Soft Colour Interaction and QCD dipole descriptions. 1