Sciweavers

1322 search results - page 28 / 265
» Parameterized counting problems
Sort
View
COCOON
2000
Springer
14 years 1 months ago
Parameterized Complexity of Finding Subgraphs with Hereditary Properties
We consider the parameterized complexity of the following problem under the framework introduced by Downey and Fellows[4]: Given a graph G, an integer parameter k and a non-trivial...
Subhash Khot, Venkatesh Raman
CPM
2007
Springer
185views Combinatorics» more  CPM 2007»
14 years 2 months ago
Algorithms for Computing the Longest Parameterized Common Subsequence
In this paper, we revisit the classic and well-studied longest common subsequence (LCS) problem and study some new variants, first introduced and studied by Rahman and Iliopoulos ...
Costas S. Iliopoulos, Marcin Kubica, M. Sohel Rahm...
DAC
2005
ACM
14 years 9 months ago
A quasi-convex optimization approach to parameterized model order reduction
In this paper an optimization based model order reduction (MOR) framework is proposed. The method involves setting up a quasiconvex program that explicitly minimizes a relaxation ...
Kin Cheong Sou, Alexandre Megretski, Luca Daniel
WABI
2007
Springer
133views Bioinformatics» more  WABI 2007»
14 years 2 months ago
RNA Folding Including Pseudoknots: A New Parameterized Algorithm and Improved Upper Bound
Predicting the secondary structure of an RNA sequence is an important problem in structural bioinformatics. The general RNA folding problem, where the sequence to be folded may con...
Chunmei Liu, Yinglei Song, Louis W. Shapiro
TROB
2010
103views more  TROB 2010»
13 years 3 months ago
Time Parameterization of Humanoid-Robot Paths
Abstract--This paper proposes a unified optimization framework to solve the time parameterization problem of humanoid robot paths. Even though the time parameterization problem is ...
Wael Suleiman, Fumio Kanehiro, Eiichi Yoshida, Jea...