Sciweavers

8647 search results - page 167 / 1730
» The Container Selection Problem
Sort
View
ALMOB
2006
97views more  ALMOB 2006»
15 years 3 months ago
The approximability of the String Barcoding problem
The String Barcoding (SBC) problem, introduced by Rash and Gusfield (RECOMB, 2002), consists in finding a minimum set of substrings that can be used to distinguish between all mem...
Giuseppe Lancia, Romeo Rizzi
CORR
2006
Springer
144views Education» more  CORR 2006»
15 years 3 months ago
The minimum linear arrangement problem on proper interval graphs
We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphs. 1 ...
Ilya Safro
SIAMCO
2002
81views more  SIAMCO 2002»
15 years 2 months ago
Optimality Conditions for Irregular Inequality-Constrained Problems
Abstract. We consider feasible sets given by conic constraints, where the cone defining the constraints is convex with nonempty interior. We study the case where the feasible set i...
Alexey F. Izmailov, Mikhail V. Solodov
SIAMMA
2010
97views more  SIAMMA 2010»
14 years 10 months ago
Small Volume Fraction Limit of the Diblock Copolymer Problem: I. Sharp-Interface Functional
We present the first of two articles on the small volume fraction limit of a nonlocal Cahn-Hilliard functional introduced to model microphase separation of diblock copolymers. Her...
Rustum Choksi, Mark A. Peletier
CSDA
2007
115views more  CSDA 2007»
15 years 3 months ago
Arbitrarily shaped multiple spatial cluster detection for case event data
An original method is proposed for spatial cluster detection of case event data. A selection order and the distance from the nearest neighbour are attributed to each point, once p...
Christophe Dematteï, Nicolas Molinari, Jean-P...