Sciweavers

3913 search results - page 312 / 783
» complexity 2006
Sort
View
PARELEC
2006
IEEE
16 years 21 days ago
Marching Pixels - Using Organic Computing Principles in Embedded Parallel Hardware
We present an organic computing approach for very fast image processing, which we call Marching Pixels (MPs). Using an embedded massively-parallel array of processor elements (PEs...
Marcus Komann, Dietmar Fey
ACIVS
2006
Springer
16 years 21 days ago
Scalable and Channel-Adaptive Unequal Error Protection of Images with LDPC Codes
This paper considers the design of an optimal joint source-channel coding system employing scalable wavelet-based source coders and unequal error protection for error-resilient tra...
Adrian Munteanu, Maryse R. Stoufs, Jan Cornelis, P...
ECAI
2006
Springer
15 years 10 months ago
Boolean Games Revisited
Abstract. Game theory is a widely used formal model for studying strategical interactions between agents. Boolean games [8] are two players, zero-sum static games where players...
Elise Bonzon, Marie-Christine Lagasquie-Schiex, J&...
DAM
2006
88views more  DAM 2006»
15 years 6 months ago
NP-completeness results for edge modification problems
The aim of edge modification problems is to change the edge set of a given graph as little as possible in order to satisfy a certain property. Edge modification problems in graphs...
Pablo Burzyn, Flavia Bonomo, Guillermo Durá...
EOR
2007
80views more  EOR 2007»
15 years 6 months ago
The tool switching problem revisited
In this note we study the tool switching problem with non-uniform tool sizes. More specifically, we consider the problem where the job sequence is given as part of the input. We ...
Yves Crama, Linda S. Moonen, Frits C. R. Spieksma,...