Results 1 - 10 of 8,408

Spill Code Minimization via Interference Region Spilling

by Peter Bergner, Peter Dahl, David Engebretsen, Matthew O'Keefe - in SIGPLAN Conference on Programming Language Design and Implementation , 1997
"... Many optimizing compilers perform global register allocation using a Chaitin-style graph coloring algorithm. Live ranges that cannot be allocated to registers are spilled to memory. The amount of code required to spill the live range depends on the spilling heuristic used. Chaitin's spilling he ..."
Abstract - Cited by 41 (1 self) - Add to MetaCart
Many optimizing compilers perform global register allocation using a Chaitin-style graph coloring algorithm. Live ranges that cannot be allocated to registers are spilled to memory. The amount of code required to spill the live range depends on the spilling heuristic used. Chaitin's spilling

Spill code minimization techniques for optimizing compilers

by David Bernstein, Martin C. Golumbic, Yishay Mansour, Ron Y. Pinter, Dina Q. Goldin, Hugo Krawczyk, Itai Nahshon , 1989
"... Global register allocation and spilling is commonly performed by solving a graph coloring problem. In this paper we present a new coherent set of heuristic methods for reducing the amount of spill code gen-erated. This results in more efficient (and shorter) compiled code. Our approach has been comp ..."
Abstract - Cited by 75 (0 self) - Add to MetaCart
Global register allocation and spilling is commonly performed by solving a graph coloring problem. In this paper we present a new coherent set of heuristic methods for reducing the amount of spill code gen-erated. This results in more efficient (and shorter) compiled code. Our approach has been

Spill Code Minimization Techniques for Graph Coloring Register Allocators

by Peter E. Bergner , 1997
"... Graph coloring algorithms have been shown to be an efficient and effective means of performing global register allocation. The power and appeal of these algorithms lie in their strong coloring heuristics and their ability to abstract away seemingly disparate allocation problems such as data-flow con ..."
Abstract - Add to MetaCart
and its location can greatly affect a program's performance, so great care should be taken to minimize the amount of spill code inserted. Previous spill code minimization techniques by Chaitin et al. at IBM Yorktown and Bernstein et al. at IBM Haifa have been limited to minimizing spill code on a

Iterative decoding of binary block and convolutional codes

by Joachim Hagenauer, Elke Offer, Lutz Papke - IEEE TRANS. INFORM. THEORY , 1996
"... Iterative decoding of two-dimensional systematic convolutional codes has been termed “turbo” (de)coding. Using log-likelihood algebra, we show that any decoder can he used which accepts soft inputs-including a priori values-and delivers soft outputs that can he split into three terms: the soft chann ..."
Abstract - Cited by 610 (43 self) - Add to MetaCart
stop criterion derived from cross entropy, which results in a minimal number of iterations. Optimal and suboptimal decoders with reduced complexity are presented. Simulation results show that very simple component codes are sufficient, block codes are appropriate for high rates and convolutional codes

Relations between the statistics of natural images and the response properties of cortical cells

by David J. Field - J. Opt. Soc. Am. A , 1987
"... The relative efficiency of any particular image-coding scheme should be defined only in relation to the class of images that the code is likely to encounter. To understand the representation of images by the mammalian visual system, it might therefore be useful to consider the statistics of images f ..."
Abstract - Cited by 831 (18 self) - Add to MetaCart
The relative efficiency of any particular image-coding scheme should be defined only in relation to the class of images that the code is likely to encounter. To understand the representation of images by the mammalian visual system, it might therefore be useful to consider the statistics of images

The SWISS-PROT protein sequence data bank and its supplement TrEMBL in 1999

by Amos Bairoch, Rolf Apweiler - Nucleic Acids Res , 1999
"... SWISS-PROT is a curated protein sequence database which strives to provide a high level of annotation (such as the description of the function of a protein, its domain structure, post-translational modifications, variants, etc.), a minimal level of redundancy and high level of integration with other ..."
Abstract - Cited by 624 (5 self) - Add to MetaCart
SWISS-PROT is a curated protein sequence database which strives to provide a high level of annotation (such as the description of the function of a protein, its domain structure, post-translational modifications, variants, etc.), a minimal level of redundancy and high level of integration

Decoding by Linear Programming

by Emmanuel J. Candès, Terence Tao , 2004
"... This paper considers the classical error correcting problem which is frequently discussed in coding theory. We wish to recover an input vector f ∈ Rn from corrupted measurements y = Af + e. Here, A is an m by n (coding) matrix and e is an arbitrary and unknown vector of errors. Is it possible to rec ..."
Abstract - Cited by 1399 (16 self) - Add to MetaCart
to recover f exactly from the data y? We prove that under suitable conditions on the coding matrix A, the input f is the unique solution to the ℓ1-minimization problem (‖x‖ℓ1:= i |xi|) min g∈R n ‖y − Ag‖ℓ1 provided that the support of the vector of errors is not too large, ‖e‖ℓ0: = |{i: ei ̸= 0} | ≤ ρ · m

The SWISS-PROT protein sequence database and its supplement TrEMBL in 2000

by Amos Bairoch, Rolf Apweiler - Nucleic Acids Res , 2000
"... SWISS-PROT is a curated protein sequence database which strives to provide a high level of annotation (such as the description of the function of a protein, its domains structure, post-translational modifications, variants, etc.), a minimal level of redundancy and high level of integration with othe ..."
Abstract - Cited by 773 (21 self) - Add to MetaCart
SWISS-PROT is a curated protein sequence database which strives to provide a high level of annotation (such as the description of the function of a protein, its domains structure, post-translational modifications, variants, etc.), a minimal level of redundancy and high level of integration

Protecting respondents’ identities in microdata release

by Pierangela Samarati - In IEEE Transactions on Knowledge and Data Engineering (TKDE , 2001
"... Today’s globally networked society places great demand on the dissemination and sharing of information. While in the past released information was mostly in tabular and statistical form, many situations call today for the release of specific data (microdata). In order to protect the anonymity of the ..."
Abstract - Cited by 512 (32 self) - Add to MetaCart
, and ZIP code, that can be linked to publicly available information to re-identify respondents and inferring information that was not intended for disclosure. In this paper we address the problem of releasing microdata while safeguarding the anonymity of the respondents to which the data refer

A comparative study of energy minimization methods for Markov random fields

by Richard Szeliski, Ramin Zabih, Daniel Scharstein, Olga Veksler, Aseem Agarwala, Carsten Rother, et al. - IN ECCV , 2006
"... One of the most exciting advances in early vision has been the development of efficient energy minimization algorithms. Many early vision tasks require labeling each pixel with some quantity such as depth or texture. While many such problems can be elegantly expressed in the language of Markov Ran ..."
Abstract - Cited by 415 (36 self) - Add to MetaCart
One of the most exciting advances in early vision has been the development of efficient energy minimization algorithms. Many early vision tasks require labeling each pixel with some quantity such as depth or texture. While many such problems can be elegantly expressed in the language of Markov
Results 1 - 10 of 8,408