Sciweavers

16 search results - page 3 / 4
» Parameterized Computation of LCS for Two Sequences
Sort
View
MST
2006
149views more  MST 2006»
13 years 7 months ago
Parameterized Intractability of Distinguishing Substring Selection
A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...
Jens Gramm, Jiong Guo, Rolf Niedermeier
IUI
2009
ACM
14 years 4 months ago
Data-driven exploration of musical chord sequences
We present data-driven methods for supporting musical creativity by capturing the statistics of a musical database. Specifically, we introduce a system that supports users in expl...
Eric Nichols, Dan Morris, Sumit Basu
CDC
2009
IEEE
114views Control Systems» more  CDC 2009»
13 years 11 months ago
Parametric model order reduction accelerated by subspace recycling
Abstract-- Many model order reduction methods for parameterized systems need to construct a projection matrix V which requires computing several moment matrices of the parameterize...
Lihong Feng, Peter Benner, Jan G. Korvink
ICPR
2010
IEEE
14 years 1 months ago
Estimating Nonrigid Shape Deformation Using Moments
Image moments have been widely used for designing robust shape descriptors that are invariant to rigid transformations. In this work, we address the problem of estimating non-rigid...
Wei Liu, Eraldo Ribeiro
SIAMJO
2000
108views more  SIAMJO 2000»
13 years 7 months ago
Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
Mathematical programs with nonlinear complementarity constraints are reformulated using better-posed but nonsmooth constraints. We introduce a class of functions, parameterized by...
Houyuan Jiang, Daniel Ralph