Results 1  10
of
3,591
Solving Square Jigsaw Puzzles with Loop Constraints
"... Abstract. We present a novel algorithm based on “loop constraints ” for assembling nonoverlapping squarepiece jigsaw puzzles where the rotation and the position of each piece are unknown. Our algorithm finds small loops of puzzle pieces which form consistent cycles. These small loops are in turn ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. We present a novel algorithm based on “loop constraints ” for assembling nonoverlapping squarepiece jigsaw puzzles where the rotation and the position of each piece are unknown. Our algorithm finds small loops of puzzle pieces which form consistent cycles. These small loops are in turn
Disambiguating visual relations using loop constraints
 In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition
, 2010
"... Repetitive and ambiguous visual structures in general pose a severe problem in many computer vision applications. Identification of incorrect geometric relations between images solely based on low level features is not always possible, and a more global reasoning approach about the consistency of ..."
Abstract

Cited by 35 (7 self)
 Add to MetaCart
for identifying inconsistent loops in the graph. This data provides indirect evidence for conflicting visual relations. Inferring the set of likely false positive geometric relations from these nonlocal observations is formulated in a Bayesian framework. We demonstrate the utility of the proposed method
Macroop scheduling: Relaxing scheduling loop constraints
 In Proceedings of the International Symposium on Microarchitecture
, 2003
"... Ensuring backtoback execution of dependent instructions in a conventional outoforder processor requires scheduling logic that wakes up and selects instructions at the same rate as they are executed. To sustain high performance, integer ALU instructions typically have singlecycle latency, consequ ..."
Abstract

Cited by 28 (2 self)
 Add to MetaCart
Ensuring backtoback execution of dependent instructions in a conventional outoforder processor requires scheduling logic that wakes up and selects instructions at the same rate as they are executed. To sustain high performance, integer ALU instructions typically have singlecycle latency, consequently requiring scheduling logic with the same singlecycle latency. Prior proposals have advocated the use of speculation in either the wakeup or select phases to enable pipelining of scheduling logic to achieve higher clock frequency. In contrast, this paper proposes macroop scheduling, which systematically removes instructions with singlecycle latency from the machine by combining them into macroops, and performs nonspeculative pipelined scheduling of multicycle operations. Macroop
Loop constraints: A habitat and their algebra Int
 J. Mod. Phys
, 1998
"... This work introduces a new space T ′ of ‘vertexsmooth ’ states for use in the loop approach to quantum gravity. Such states provide a natural domain for Euclidean Hamiltonian constraint operators of the type introduced by Thiemann (and using certain ideas of Rovelli and Smolin). In particular, such ..."
Abstract

Cited by 19 (1 self)
 Add to MetaCart
This work introduces a new space T ′ of ‘vertexsmooth ’ states for use in the loop approach to quantum gravity. Such states provide a natural domain for Euclidean Hamiltonian constraint operators of the type introduced by Thiemann (and using certain ideas of Rovelli and Smolin). In particular
Constrained model predictive control: Stability and optimality
 AUTOMATICA
, 2000
"... Model predictive control is a form of control in which the current control action is obtained by solving, at each sampling instant, a finite horizon openloop optimal control problem, using the current state of the plant as the initial state; the optimization yields an optimal control sequence and t ..."
Abstract

Cited by 738 (16 self)
 Add to MetaCart
Model predictive control is a form of control in which the current control action is obtained by solving, at each sampling instant, a finite horizon openloop optimal control problem, using the current state of the plant as the initial state; the optimization yields an optimal control sequence
Adaptively Constrained Stochastic Model Predictive Control for ClosedLoop Constraint Satisfaction
"... discretetime linear systems subject to additive disturbances with chance constraints on the states and hard constraints on the inputs is considered. Current chance constrained MPC methods—based on analytic reformulations or on sampling approaches—tend to be conservative partly because they fail to ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
to exploit the predefined violation level in closedloop. For many practical applications, this conservatism can lead to a loss in performance. We propose an adaptive SMPC scheme that starts with a standard conservative chance constrained formulation and then online adapts the formulation of constraints
A hidden Markov model for predicting transmembrane helices in protein sequences
 In Proceedings of the 6th International Conference on Intelligent Systems for Molecular Biology (ISMB
, 1998
"... A novel method to model and predict the location and orientation of alpha helices in membrane spanning proteins is presented. It is based on a hidden Markov model (HMM) with an architecture that corresponds closely to the biological system. The model is cyclic with 7 types of states for helix core, ..."
Abstract

Cited by 373 (9 self)
 Add to MetaCart
, helix caps on either side, loop on the cytoplasmic side, two loops for the noncytoplasmic side, and a globular domain state in the middle of each loop. The two loop paths on the noncytoplasmic side are used to model short and long loops separately, which corresponds biologically to the two known
Noname manuscript No. (will be inserted by the editor) On Camera Calibration with Linear Programming and Loop Constraint
"... Abstract A technique for calibrating a network of perspective cameras based on their graph of trifocal tensors is presented. After estimating a set of reliable epipolar geometries, a parameterization of the graph of trifocal tensors is proposed in which each trifocal tensor is linearly encoded by ..."
Abstract
 Add to MetaCart
. Both methods are based on sequential linear programming: the first relies on a locally linear approximation of the polynomials involved in the loop constraints whereas the second uses alternating minimization. Both methods have the advantage of being nonincremental and of uniformly dis
Scanning Polyhedra with DO Loops
, 1991
"... Supercompilers perform complex program transformations which often result in new loop bounds. This paper shows that, under the usual assumptions in automatic parallelization, most transformations on loop nests can be expressed as affine transformations on integer sets de ned by polyhedra and that th ..."
Abstract

Cited by 216 (5 self)
 Add to MetaCart
and that the new loop bounds can be computed with algorithms using Fourier's pairwise elimination method although it is not exact for integer sets. Sufficient conditions to use pairwise elimination on integer sets and to extend it to pseudolinear constraints are also given. A tradeo has to be made between
ASSAT: Computing Answer Sets of a Logic Program by SAT Solvers
 Artificial Intelligence
, 2002
"... We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a normal logic program, we show that by adding, for each loop in the program, a corresponding loop formula to the program’s completion, we obtain a onetoone corresp ..."
Abstract

Cited by 260 (7 self)
 Add to MetaCart
We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a normal logic program, we show that by adding, for each loop in the program, a corresponding loop formula to the program’s completion, we obtain a one
Results 1  10
of
3,591