Sciweavers

83 search results - page 12 / 17
» dam 2006
Sort
View
DAM
2006
116views more  DAM 2006»
13 years 8 months ago
Using graphs for some discrete tomography problems
Given a rectangular array where entries represent the pixels of a digitalized image, we consider the problem of reconstructing an image from the number of occurrences of each colo...
Marie-Christine Costa, Dominique de Werra, Christo...
DAM
2006
113views more  DAM 2006»
13 years 8 months ago
On the complexity of suboptimal decoding for list and decision feedback schemes
We consider bounded distance list decoding, such that the decoder calculates the list of all codewords within a sphere around the received vector. We analyze the performance and t...
Jürgen Freudenberger, Victor V. Zyablov
DAM
2006
88views more  DAM 2006»
13 years 8 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á...
DAM
2006
191views more  DAM 2006»
13 years 8 months ago
Approximating the minimum clique cover and other hard problems in subtree filament graphs
Subtree filament graphs are the intersection graphs of subtree filaments in a tree. This class of graphs contains subtree overlap graphs, interval filament graphs, chordal graphs,...
J. Mark Keil, Lorna Stewart
DAM
2006
88views more  DAM 2006»
13 years 8 months ago
Finding nonnormal bent functions
The question if there exist nonnormal bent functions was an open question for several years. A Boolean function in n variables is called normal if there exists an affine subspace ...
Anne Canteaut, Magnus Daum, Hans Dobbertin, Gregor...