Results 1  10
of
2,720
Trace Scheduling: A Technique for Global Microcode Compaction
 IEEE TRANSACTIONS ON COMPUTERS
, 1981
"... Microcode compaction is the conversion of sequential microcode into efficient parallel (horizontal) microcode. Local compaction techniques are those whose domain is basic blocks of code, while global methods attack code with a general flow control. Compilation of highlevel microcode languages int ..."
Abstract

Cited by 683 (5 self)
 Add to MetaCart
Microcode compaction is the conversion of sequential microcode into efficient parallel (horizontal) microcode. Local compaction techniques are those whose domain is basic blocks of code, while global methods attack code with a general flow control. Compilation of highlevel microcode languages
Global Optimization with Polynomials and the Problem of Moments
 SIAM JOURNAL ON OPTIMIZATION
, 2001
"... We consider the problem of finding the unconstrained global minimum of a realvalued polynomial p(x) : R R, as well as the global minimum of p(x), in a compact set K defined by polynomial inequalities. It is shown that this problem reduces to solving an (often finite) sequence of convex linear ma ..."
Abstract

Cited by 577 (48 self)
 Add to MetaCart
We consider the problem of finding the unconstrained global minimum of a realvalued polynomial p(x) : R R, as well as the global minimum of p(x), in a compact set K defined by polynomial inequalities. It is shown that this problem reduces to solving an (often finite) sequence of convex linear
Complete discrete 2D Gabor transforms by neural networks for image analysis and compression
, 1988
"... A threelayered neural network is described for transforming twodimensional discrete signals into generalized nonorthogonal 2D “Gabor” representations for image analysis, segmentation, and compression. These transforms are conjoint spatial/spectral representations [lo], [15], which provide a comp ..."
Abstract

Cited by 478 (8 self)
 Add to MetaCart
complete image description in terms of locally windowed 2D spectral coordinates embedded within global 2D spatial coordinates. Because intrinsic redundancies within images are extracted, the resulting image codes can be very compact. However, these conjoint transforms are inherently difficult to compute
Local microcode compaction techniques
 ACM Computing Surveys
, 1980
"... Microcode compaction is an essential tool for the compilation of highlevel language microprograms into microinstructions with parallel microoperations. Although guaranteeing minimum execution time is an exponentially complex problem, recent research indicates that it is not difficult to obtain prac ..."
Abstract

Cited by 53 (0 self)
 Add to MetaCart
Microcode compaction is an essential tool for the compilation of highlevel language microprograms into microinstructions with parallel microoperations. Although guaranteeing minimum execution time is an exponentially complex problem, recent research indicates that it is not difficult to obtain
Conformal deformation of a Riemannian metric to constant curvature
 J. Diff. Geome
, 1984
"... A wellknown open question in differential geometry is the question of whether a given compact Riemannian manifold is necessarily conformally equivalent to one of constant scalar curvature. This problem is known as the Yamabe problem because it was formulated by Yamabe [8] in 1960, While Yamabe&apos ..."
Abstract

Cited by 308 (0 self)
 Add to MetaCart
A wellknown open question in differential geometry is the question of whether a given compact Riemannian manifold is necessarily conformally equivalent to one of constant scalar curvature. This problem is known as the Yamabe problem because it was formulated by Yamabe [8] in 1960, While Yamabe
Local Feature Analysis: A general statistical theory for object representation
, 1996
"... . Lowdimensional representations of sensory signals are key to solving many of the computational problems encountered in highlevel vision. Principal Component Analysis has been used in the past to derive practically useful compact representations for different classes of objects. One major object ..."
Abstract

Cited by 285 (8 self)
 Add to MetaCart
representations for any class of objects. The LFA representations are sparsedistributed and, hence, are effectively lowdimensional and retain all the advantages of the compact representations of the PCA. But unlike the global eigenmodes, they give a description of objects in terms of statistically derived local
Temporal Reasoning Based on SemiIntervals
, 1992
"... A generalization of Allen's intervalbased approach to temporal reasoning is presented. The notion of `conceptual neighborhood' of qualitative relations between events is central to the presented approach. Relations between semiintervals rather than intervals are used as the basic units o ..."
Abstract

Cited by 286 (15 self)
 Add to MetaCart
and efficiency; 6) for a natural subset of Allen's algebra, global consistency can be guaranteed in polynomial time; 7) knowledge about relations between events can be represented much more compactly.
NonLinear Approximation of Reflectance Functions
, 1997
"... We introduce a new class of primitive functions with nonlinear parameters for representing light reflectance functions. The functions are reciprocal, energyconserving and expressive. They can capture important phenomena such as offspecular reflection, increasing reflectance and retroreflection. ..."
Abstract

Cited by 269 (10 self)
 Add to MetaCart
reflection. We demonstrate this by fitting sums of primitive functions to a physicallybased model and to actual measurements. The resulting representation is simple, compact and uniform. It can be applied efficiently in analytical and Monte Carlo computations. CR Categories: I.3.7 [Computer Graphics]: Three
List Processing in Real Time on a Serial Computer
 SERIAL COMPUTER, COMM. ACM
, 1977
"... A realtime list processing system is one in which the time required by the elementary list operations (e.g. CONS, CAR, COR, RPLACA, RPLACD, EQ, and ATOM in LISP) is bounded by a (small) constant. Classical implementations of list processing systems lack this property because allocating a list cell ..."
Abstract

Cited by 228 (14 self)
 Add to MetaCart
from the heap may cause a garbage collection, which process requires time proportional to the heap size to finish. A realtime list processing system is presented which continuously reclaims garbage, including directed cycles, while linearizing and compacting the accessible cells into contiguous
Motivation and Framework for Using Genetic Algorithms for Microcode Compaction
 In Proceedings of the 23rd Annual Workshop in Microprogramming and Microarchitecture (MICRO23
, 1990
"... Genetic algorithms are a robust adaptive optimization technique based on a biological paradigm. They perform efficient search on poorlydefined spaces by maintaining an ordered pool of strings that represent regions in the search space. New strings are produced from existing strings using the geneti ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
have been successfully used in problems such as the traveling salesperson and scheduling job shops. Microcode compaction can be modeled as these same types of problems, which motivates the application of genetic algorithms in this domain. 1 Introduction Microcode compaction techniques have been based
Results 1  10
of
2,720