Sciweavers

2032 search results - page 184 / 407
» Encodings of the Sequence Constraint
Sort
View
RECOMB
2002
Springer
16 years 6 months ago
Approximate matching of secondary structures
This talk presents an algorithm to search for all approximate matches of a helix in a genome, where a helix is a combination of sequence and folding constraints. It is a joint wor...
Nadia El-Mabrouk, Mathieu Raffinot
ARTS
1999
Springer
15 years 10 months ago
A Formal Model of Real-Time Program Compilation
Program compilation can be formally defined as a sequence of equivalence-preserving transformations, or refinements, from highlevel language programs to assembler code. Recent mo...
Karl Lermer, Colin J. Fidge
CORR
2006
Springer
128views Education» more  CORR 2006»
15 years 6 months ago
Generalizations of the Hanoi Towers Problem
Our theme bases on the classical Hanoi Towers Problem. In this paper we will define a new problem, permitting some positions, that were not legal in the classical problem. Our goa...
Sergey Benditkis, Ilya Safro
SIAMJO
2000
88views more  SIAMJO 2000»
15 years 6 months ago
A Feasible BFGS Interior Point Algorithm for Solving Convex Minimization Problems
Abstract. We propose a BFGS primal-dual interior point method for minimizing a convex function on a convex set defined by equality and inequality constraints. The algorithm generat...
Paul Armand, Jean Charles Gilbert, Sophie Jan-J&ea...
CVPR
2005
IEEE
16 years 8 months ago
Visibility Constrained Surface Evolution
The problem of feature-based surface reconstruction is considered in this paper. Our main contribution is the ability to handle visibility constraints, obtained from the projectio...
Jan Erik Solem, Fredrik Kahl, Anders Heyden