Sciweavers

849 search results - page 5 / 170
» On the Complexity of the Whitehead Minimization Problem
Sort
View
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
14 years 8 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy
CCCG
2010
13 years 9 months ago
On stretch minimization problem on unit strip paper
For a given mountain-valley pattern of equidistant creases on a long strip paper, there are many folded states consistent with the pattern. Among these folded states, we like to f...
Ryuhei Uehara
IGARSS
2009
13 years 5 months ago
Complex Wavelet Regularization for Solving Inverse Problems in Remote Sensing
Many problems in remote sensing can be modeled as the minimization of the sum of a data term and a prior term. We propose to use a new complex wavelet based prior and an efficient...
Mikael Carlavan, Pierre Weiss, Laure Blanc-F&eacut...
ESA
2009
Springer
92views Algorithms» more  ESA 2009»
14 years 2 months ago
Minimizing Movement: Fixed-Parameter Tractability
Abstract. We study an extensive class of movement minimization problems which arise from many practical scenarios but so far have little theoretical study. In general, these proble...
Erik D. Demaine, MohammadTaghi Hajiaghayi, D&aacut...
JAIR
2008
99views more  JAIR 2008»
13 years 7 months ago
The Complexity of Planning Problems With Simple Causal Graphs
We present three new complexity results for classes of planning problems with simple causal graphs. First, we describe a polynomial-time algorithm that uses macros to generate pla...
Omer Giménez, Anders Jonsson