Sciweavers

216 search results - page 16 / 44
» Exact Algorithms for L (2, 1)-Labeling of Graphs
Sort
View
TIP
1998
128views more  TIP 1998»
13 years 7 months ago
Nonlinear wavelet image processing: variational problems, compression, and noise removal through wavelet shrinkage
This paper examines the relationship between wavelet-based image processing algorithms and variational problems. Algorithms are derived as exact or approximate minimizers of varia...
Antonin Chambolle, Ronald A. DeVore, Nam-Yong Lee,...
SPAA
2009
ACM
14 years 8 months ago
Routing without ordering
We analyze the correctness and complexity of two well-known routing algorithms, introduced by Gafni and Bertsekas (1981): By reversing the directions of some edges, these algorith...
Bernadette Charron-Bost, Antoine Gaillard, Jennife...
GCB
2009
Springer
180views Biometrics» more  GCB 2009»
14 years 2 months ago
2D Projections of RNA Folding Landscapes
Abstract: The analysis of RNA folding landscapes yields insights into the kinetic folding behavior not available from classical structure prediction methods. This is especially imp...
Ronny Lorenz, Christoph Flamm, Ivo L. Hofacker
EXACT
2009
13 years 5 months ago
Towards the Explanation of Workflows
Across many fields involving complex computing, software systems are being augmented with workflow logging functionality. The log data can be effectively organized using declarativ...
James Michaelis, Li Ding, Deborah L. McGuinness
ALGORITHMICA
2005
149views more  ALGORITHMICA 2005»
13 years 7 months ago
Approximating Maximum Weight Cycle Covers in Directed Graphs with Weights Zero and One
A cycle cover of a graph is a spanning subgraph each node of which is part of exactly one simple cycle. A k-cycle cover is a cycle cover where each cycle has length at least k. Gi...
Markus Bläser, Bodo Manthey