520 search results - page 29 / 104 » Reductions Between Expansion Problems |
CPM
2004
Springer
14 years 2 months ago
2004
Springer
In this paper we investigate the protein sequence design (PSD) problem (also known as the inverse protein folding problem) under the Canonical model 4 on 2D and 3D lattices [12, 25...
EUROCAST
2005
Springer
14 years 2 months ago
2005
Springer
abstract NP-hard optimization problem, in a general sense. From the observation that, intuitively, there are many connections among categorical concepts and structural complexity n...
WEA
2005
Springer
14 years 2 months ago
2005
Springer
The vertex cover problem is a classic NP-complete problem for which the best worst-case approximation ratio is roughly 2. In this paper, we use a collection of simple reductions, e...
CLEF
2004
Springer
14 years 2 months ago
2004
Springer
This article describes the technologies used for the various runs submitted by the University of Geneva in the context of the 2004 ImageCLEF competition. As our expertise is mainly...
SIAMAM
2008
13 years 8 months ago
2008
Abstract. We present numerical solutions of a two-dimensional Riemann problem for the compressible Euler equations that describes the Mach reflection of weak shock waves. High reso...