Sciweavers

2652 search results - page 162 / 531
» Privacy-preserving linear programming
Sort
View
177
Voted
BMCBI
2002
108views more  BMCBI 2002»
15 years 3 months ago
A memory-efficient dynamic programming algorithm for optimal alignment of a sequence to an RNA secondary structure
Background: Covariance models (CMs) are probabilistic models of RNA secondary structure, analogous to profile hidden Markov models of linear sequence. The dynamic programming algo...
Sean R. Eddy
135
Voted
INFORMS
1998
100views more  INFORMS 1998»
15 years 3 months ago
Feature Selection via Mathematical Programming
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...
Paul S. Bradley, Olvi L. Mangasarian, W. Nick Stre...
ISPD
2004
ACM
189views Hardware» more  ISPD 2004»
15 years 8 months ago
Almost optimum placement legalization by minimum cost flow and dynamic programming
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
Ulrich Brenner, Anna Pauli, Jens Vygen
ECCV
2008
Springer
16 years 5 months ago
Finding Actions Using Shape Flows
Abstract. We propose a novel method for action detection based on a new action descriptor called a shape flow that represents both the shape and movement of an object in a holistic...
Hao Jiang, David R. Martin
136
Voted
MP
2008
117views more  MP 2008»
15 years 3 months ago
Multiplier convergence in trust-region methods with application to convergence of decomposition methods for MPECs
Abstract. We study piecewise decomposition methods for mathematical programs with equilibrium constraints (MPECs) for which all constraint functions are linear. At each iteration o...
Giovanni Giallombardo, Daniel Ralph