Sciweavers

805 search results - page 59 / 161
» Combinatorial optimization problems in self-assembly
Sort
View
SBIA
2010
Springer
13 years 9 months ago
High-Level Modeling of Component-Based CSPs
Most of modern constraint modeling languages combine rich constraint languages with mathematical notations to tackle combinatorial optimization problems. Our purpose is to introduc...
Raphaël Chenouard, Laurent Granvilliers, Rica...
ICIP
2003
IEEE
15 years 22 days ago
Sparse decompositions in "incoherent" dictionaries
The purpose of this paper is to generalize a result by Donoho, Huo, Elad and Bruckstein on sparse representations of signals/images in a union of two orthonormal bases. We conside...
Morten Nielsen, Rémi Gribonval
DGCI
2005
Springer
14 years 4 months ago
Uncertain Geometry in Computer Vision
Abstract. We give an overview of the main ideas and tools that have been employed in uncertain geometry. We show how several recognition problems in computer vision can be translat...
Peter Veelaert
IPPS
1999
IEEE
14 years 3 months ago
Mapping Media Streams onto a Network of Servers
This paper presents the definition as well as a number of methods for the solution of a new combinatorial optimization problem, called S-MAMP that has to be solved for the efficie...
Reinhard Lüling
TAMC
2009
Springer
14 years 5 months ago
Approximation and Hardness Results for Label Cut and Related Problems
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...
Peng Zhang, Jin-yi Cai, Linqing Tang, Wenbo Zhao