1542 search results - page 76 / 309 » Kernelization of packing problems |
134
click to vote
CP
2001
Springer
15 years 6 months ago
2001
Springer
Abstract. Selecting conformations for side-chains is an important subtask in building three-dimensional protein models. Side-chain placement is a difficult problem because of the l...
110
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
129
click to vote
FOCM
2010
15 years 2 days ago
2010
We show how to approximate the feasible region of structured convex optimization problems by a family of convex sets with explicitly given and efficient (if the accuracy of the ap...
188
click to vote
IWPEC
2010
Springer
14 years 11 months ago
2010
Springer
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
120
click to vote
ICPR
2008
IEEE
16 years 2 months ago
2008
IEEE
Speaker independent feature extraction is a critical problem in speech recognition. Oriented principal component analysis (OPCA) is a potential solution that can find a subspace r...