Results 11  20
of
1,148
BitVector Optimization
"... Abstract. A variety of applications of Satisfiability Modulo Theories (SMT) require finding a satisfying assignment which optimizes some usergiven function. Optimization in the context of SMT is referred to as Optimization Modulo Theories (OMT). Current OMT research is mostly dedicated to optimizat ..."
Abstract
 Add to MetaCart
to optimization in arithmetic domains. This paper is about Optimization modulo BitVectors (OBV). We introduce two OBV algorithms which can easily be implemented in an eager bitvector solver. We show that an industrial problem of fixing cell placement during the physical design stage of the CAD process can
Algorithms for Intersecting Parametric and Algebraic Curves I: Simple Intersections
 ACM Transactions on Graphics
, 1995
"... : The problem of computing the intersection of parametric and algebraic curves arises in many applications of computer graphics and geometric and solid modeling. Previous algorithms are based on techniques from elimination theory or subdivision and iteration. The former is however, restricted to low ..."
Abstract

Cited by 70 (19 self)
 Add to MetaCart
: The problem of computing the intersection of parametric and algebraic curves arises in many applications of computer graphics and geometric and solid modeling. Previous algorithms are based on techniques from elimination theory or subdivision and iteration. The former is however, restricted
Handling BitPropagating Operations in BitVector Reasoning
"... Our aim is to improve bitvector reasoning in modern SMT solvers. We enhance bitvector preprocessing by introducing algorithms that explicitly handle an important class of bitvector operations which we call bitpropagating. Such operations fulfill the following property: each output bit is either a ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Our aim is to improve bitvector reasoning in modern SMT solvers. We enhance bitvector preprocessing by introducing algorithms that explicitly handle an important class of bitvector operations which we call bitpropagating. Such operations fulfill the following property: each output bit is either
A Fast and Practical BitVector Algorithm for the Longest Common Subsequence Problem
 Information Processing Letters
, 2000
"... This paper presents a new practical bitvector algorithm for solving the well known Longest Common Subsequence (LCS) problem. Given two strings of length m and n, n m, we present an algorithm which determines the length p of an LCS in O(nm=w) time and O(m=w) space, where w is the number of bits in a ..."
Abstract

Cited by 33 (2 self)
 Add to MetaCart
This paper presents a new practical bitvector algorithm for solving the well known Longest Common Subsequence (LCS) problem. Given two strings of length m and n, n m, we present an algorithm which determines the length p of an LCS in O(nm=w) time and O(m=w) space, where w is the number of bits
FACTORIZATION PROBLEM WITH INTERSECTION
, 2014
"... Abstract. We propose a generalization of the factorization method to the case when is a finitedimensional Lie algebra = 0 ⊕ ⊕ (direct sum of vector spaces), where 0 is a subalgebra in , , are 0 modules, and 0 + , 0 + are subalgebras in . In particular, our construction involves the case when is a ..."
Abstract
 Add to MetaCart
Abstract. We propose a generalization of the factorization method to the case when is a finitedimensional Lie algebra = 0 ⊕ ⊕ (direct sum of vector spaces), where 0 is a subalgebra in , , are 0 modules, and 0 + , 0 + are subalgebras in . In particular, our construction involves the case when
On synthesis for unbounded bitvector arithmetic
, 2012
"... Abstract. We propose to describe computations using QFPAbit, a language of quantifierfree linear arithmetic on unbounded integers with bitvector operations. We describe an algorithm that, given a QFPAbit formula with input and output variables denoting integers, generates an efficient function from ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
to an exponential blowup, addressing a practical problem with a previous approach that used the MONA tool to generate the specification automata. 1
Efficient Identification of Design Patterns with Bitvector Algorithm
 In CSMR ’06: Proceedings of the Conference on Software Maintenance and Reengineering
, 2006
"... Design patterns are important in software maintenance because they help in designing, in understanding, and in reengineering programs. The identification of occurrences of a design pattern consists in identifying, in a program, classes which structure and organisation match—strictly or approximatel ..."
Abstract

Cited by 23 (4 self)
 Add to MetaCart
—strictly or approximately—the structure and organisation of classes as suggested by the design pattern. We express the problem of design pattern identification with operations on finite sets of bitvectors. We use the inherent parallelism of bitwise operations to derive an efficient bitvector algorithm that finds exact
Largescale image retrieval with compressed Fisher vectors
 IN: CVPR PERRONNIN F, SÁNCHEZ J, LIU Y (2010B) LARGESCALE
, 2010
"... The problem of largescale image search has been traditionally addressed with the bagofvisualwords (BOV). In this article, we propose to use as an alternative the Fisher kernel framework. We first show why the Fisher representation is wellsuited to the retrieval problem: it describes an image by ..."
Abstract

Cited by 100 (8 self)
 Add to MetaCart
The problem of largescale image search has been traditionally addressed with the bagofvisualwords (BOV). In this article, we propose to use as an alternative the Fisher kernel framework. We first show why the Fisher representation is wellsuited to the retrieval problem: it describes an image
Ranking function synthesis for bitvector relations
 In Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS’10
, 2010
"... Abstract. Ranking function synthesis is a key aspect to the success of modern termination provers for imperative programs. While it is wellknown how to generate linear ranking functions for relations over (mathematical) integers or rationals, efficient synthesis of ranking functions for machinelev ..."
Abstract

Cited by 22 (5 self)
 Add to MetaCart
level integers (bitvectors) is an open problem. This is particularly relevant for the verification of lowlevel code. We propose several novel algorithms to generate ranking functions for relations over machine integers: a complete method based on a reduction to Presburger arithmetic, and a template
RateDistortion Optimized Mode Selection for Very Low Bit Rate Video Coding and the Emerging H.263 Standard
, 1995
"... This paper addresses the problem of encoder optimization in a macroblockbased multimode video compression system. An efficient solution is proposed in which, for a given image region, the optimum combination of macroblock modes and the associated mode parameters are jointly selected so as to minim ..."
Abstract

Cited by 102 (14 self)
 Add to MetaCart
This paper addresses the problem of encoder optimization in a macroblockbased multimode video compression system. An efficient solution is proposed in which, for a given image region, the optimum combination of macroblock modes and the associated mode parameters are jointly selected so
Results 11  20
of
1,148