8,303 Hits in 4.9 sec

Array Unification: A Locality Optimization Technique [chapter]

Mahmut Taylan Kandemir
2001 Lecture Notes in Computer Science  
This paper describes a compiler technique, called array unification, that automatically maps multiple arrays into a single data (array) space to improve data locality.  ...  Most of the layout optimizations proposed so far either modify the layout of each array independently or are based on explicit data reorganizations at runtime.  ...  Li [12] proposes a locality optimization technique that models the reuse behavior between different references to the same array accurately.  ... 
doi:10.1007/3-540-45306-7_18 fatcat:scvhnrqbinccvndjt4akpfxk3m

Synthesis through Unification [article]

Rajeev Alur, Pavol Cerny, Arjun Radhakrishna
2015 arXiv   pre-print
We present a generic synthesis procedure based on the STUN approach and specialize it for three different domains by providing the appropriate unification operators.  ...  We present the synthesis through unification (STUN) approach, which is an extension of the counter-example guided inductive synthesis (CEGIS) approach.  ...  Later, we discuss briefly how to extend the technique to integer variables. Unification.  ... 
arXiv:1505.05868v1 fatcat:o3hscxbvijbttfrspzf7xflhpu

Approximate Bit Vectors for Fast Unification [chapter]

Matthew Skala, Gerald Penn
2011 Lecture Notes in Computer Science  
We present a novel bit vector technique based on allowing one-sided errors; the resulting approximate bit vectors can be much shorter than the minimum lengths required by existing techniques that would  ...  Bit vectors provide a way to compute the existence of least upper bounds in partial orders, which is a fundamental operation needed by any unificationbased parser.  ...  The work of Skala et al. takes its inspiration from the well-known technique called Bloom filtering [2, 11] , which stores a sparse array of bits in reduced space by mapping each index in the large array  ... 
doi:10.1007/978-3-642-23211-4_10 fatcat:bkya3fnpazfqpm4sch2u24mcne

Unification and refactoring of clones

Giri Panamoottil Krishnan, Nikolaos Tsantalis
2014 2014 Software Evolution Week - IEEE Conference on Software Maintenance, Reengineering, and Reverse Engineering (CSMR-WCRE)  
We compared the proposed technique with a competitive clone refactoring tool and concluded that our approach is able to find a significantly larger number of refactorable clones.  ...  However, the unification and refactoring of software clones is a challenging problem, since clones usually go through several modifications after their initial introduction.  ...  The proposed technique builds on top of a previous work [8] , in which we presented our initial ideas on treating the unification of clones as an optimization problem.  ... 
doi:10.1109/csmr-wcre.2014.6747160 dblp:conf/csmr/KrishnanT14 fatcat:upuy7kz3ffcpzaskge4f2ll6dm

Synthesis Through Unification [chapter]

Rajeev Alur, Pavol Černý, Arjun Radhakrishna
2015 Lecture Notes in Computer Science  
We present a generic synthesis procedure based on the STUN approach and specialize it for three different domains by providing the appropriate unification operators.  ...  We present the synthesis through unification (STUN) approach, which is an extension of the counterexample guided inductive synthesis (CEGIS) approach.  ...  The array search n and array sum n benchmarks respectively specify functions that search for a given input in an array, and check if the sum of two consecutive elements in an array is equal to a given  ... 
doi:10.1007/978-3-319-21668-3_10 fatcat:2yrz6rkujresvlc76hwgqxlvsa

A Unification of Inheritance and Automatic Program Specialization [chapter]

Ulrik P. Schultz
2004 Lecture Notes in Computer Science  
This paper presents the language JUST, which integrates object-oriented concepts, block structure, and techniques from automatic program specialization to provide both a generative programming language  ...  We have unified automatic program specialization and inheritance into a single concept, and implemented this approach in a modified version of Java named JUST.  ...  Comparing Partial Evaluation and Inheritance Partial evaluation Partial evaluation is a program transformation technique that optimizes a program fragment with respect to information about a context  ... 
doi:10.1007/978-3-540-30175-2_13 fatcat:rjxzgfoewrdr3oczk7fdaqi4zq

Automata-driven efficient subterm unification

R. Ramesh, I.V. Ramakrishnan, R.C. Sekar
2001 Theoretical Computer Science  
The string-matching approach, in conjunction with two new techniques called bidirectional-reduce and marking enables e cient uniÿcation of s with every subterm of p.  ...  The central idea used in our algorithm is to reduce the common part computation in uniÿcation into a string-matching problem and solve it e ciently using a string-matching automaton.  ...  In addition to these arrays CommonPart uses local variables p 1 ; p 2 ; l 1 ; l 2 and lastvar. p 1 and p 2 point to positions in the preorders of the two input terms upto which CommonPart has proceeded  ... 
doi:10.1016/s0304-3975(99)00131-0 fatcat:aehivjrbhfayhou4k2cgiw42ma

Unification of some Least Squares Clustering Methods

H. M. M. ten Eikelder, A. A. van Erk
2004 Journal of Mathematical Modelling and Algorithms  
We consider the K-means/Lloyd's algorithm, various local search based methods and clustering techniques based on neural networks. The relations between the various algorithms are explained.  ...  We give a unifying description of several least squares clustering methods.  ...  However a local search method will for each a terminate with an optimal clustering.  ... 
doi:10.1023/b:jmma.0000036581.87064.ed fatcat:obbxcln2mncovhcjyslo3afbny

A graph unification machine for NL parsing

V. Kešelj, N. Cercone
2003 Computers and Mathematics with Applications  
A simple, novel, and efficient computational model for a graph unification method fdr NL parsing is presented.  ...  We rely on the body of existing research on labeled graph unification for natural language parsing.  ...  For example, the memory scheme can be further simplified and optimized; instead of using arc lists we can use arrays of arcs.  ... 
doi:10.1016/s0898-1221(03)90034-4 fatcat:fharltglgvfy3e2znsf23m6phm

Unification of Compiled and Interpreter-Based Pattern Matching Techniques [chapter]

Gergely Varró, Anthony Anjorin, Andy Schürr
2012 Lecture Notes in Computer Science  
In this paper, we propose a graph pattern matching framework that produces both a standalone compiled and an interpreter-based engine as a result of a uniform development process.  ...  Such a technique could offer more flexibility (e.g., model-sensitive performance optimization [VDWS12] ) and provide additional services such as highlevel debug support, as the interpreter can access  ...  Due to space restrictions, search plans generation techniques like [GSR05, VDWS12, VVF05] and their details (e.g., cost functions, optimization algorithms) are not discussed in this paper.  ... 
doi:10.1007/978-3-642-31491-9_28 fatcat:vq5wlgsc3febbfuikclzbbdix4

Unification-based Pointer Analysis without Oversharing [article]

Jakub Kuderski, Jorge A. Navas, Arie Gurfinkel
2019 arXiv   pre-print
We present a new pointer analysis for LLVM, called TeaDsa, without such an oversharing.  ...  In this paper, we show that existing context-sensitive unification-based pointer analyses suffer from the problem of oversharing -- propagating too many abstract objects across the analysis of different  ...  A survey by Hind [4] (from 2001!) provides a good overview of techniques and precision vs cost trade-offs.  ... 
arXiv:1906.01706v2 fatcat:i43qb7mpqbcsrosj5zj6dhex3q

A Unification of Weighted and Unweighted Particle Filters [article]

Ehsan Abedi, Simone Carlo Surace, Jean-Pascal Pfister
2021 arXiv   pre-print
arise as special cases from a broad class, and that there is a smooth transition between the two.  ...  In particular, we demonstrate that the bootstrap particle filter (BPF), which relies on importance sampling, and the feedback particle filter (FPF), which is an unweighted PF based on optimal control,  ...  However, to the best of our knowledge a unification of weighted and unweighted approaches such as this one has not been attempted.  ... 
arXiv:2011.13804v2 fatcat:l2klcckmnvf3zpla55mxkdxlyi

Practical issues in compiling typed unification grammars for speech recognition

John Dowding, Beth Ann Hockey, Jean Mark Gawron, Christopher Culy
2001 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics - ACL '01  
One way to address the problems of the grammar-based approach is to compile recognition grammars from grammars written in a more expressive formalism.  ...  We will also describe and evaluate additional techniques to reduce the structural ambiguity of the language model.  ...  during node array optimization.  ... 
doi:10.3115/1073012.1073034 dblp:conf/acl/DowdingHGC01 fatcat:bxkqnrplybhnxpsf6ezpdmurge

Unification of parton and coupled-wire approaches to quantum magnetism in two dimensions [article]

Eyal Leviatan, David F. Mross
2020 arXiv   pre-print
We exemplify this technique for several chiral and non-chiral quantum spin liquids.  ...  This correspondence allows us to compute physical correlation functions within both formulations and leads to a straightforward algorithm for constructing parent Hamiltonians for a wide range of exotic  ...  Acknowledgments It is a pleasure to thank Jason Alicea, Olexei Motrunich, and Chong Wang for many illuminating discussions.  ... 
arXiv:2006.16256v1 fatcat:7icrpzfiljduhmzzxgm6didrdm

A comparative study of universal quantum computing models: towards a physical unification [article]

D.-S. Wang
2021 arXiv   pre-print
In this work, we carried out a primary attempt to unify UQCM by classifying a few of them as two categories, hence making a table of models.  ...  Quantum computing has been a fascinating research field in quantum physics.  ...  The unification of UQCM is made possible due to a few recent progresses.  ... 
arXiv:2108.07909v2 fatcat:66rvuzc2jrcmbf3347a2xul2gm
« Previous Showing results 1 — 15 out of 8,303 results