Sciweavers

1064 search results - page 75 / 213
» Exact Algorithms for the Quadratic Linear Ordering Problem
Sort
View
SIAMSC
2010
215views more  SIAMSC 2010»
15 years 2 months ago
A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation
We propose a fast algorithm for solving the ℓ1-regularized minimization problem minx∈Rn µ x 1 + Ax − b 2 2 for recovering sparse solutions to an undetermined system of linea...
Zaiwen Wen, Wotao Yin, Donald Goldfarb, Yin Zhang
ASIACRYPT
2008
Springer
15 years 6 months ago
Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
We study the problem of finding solutions to linear equations modulo an unknown divisor p of a known composite integer N. An important application of this problem is factorization ...
Mathias Herrmann, Alexander May
ALGORITHMICA
2008
52views more  ALGORITHMICA 2008»
15 years 4 months ago
From Constrained to Unconstrained Maximum Agreement Subtree in Linear Time
We propose and study the Maximum Constrained Agreement Subtree (MCAST) problem, which is a variant of the classical Maximum Agreement Subtree (MAST) problem. Our problem allows us...
V. Berry, Z. S. Peng, H. F. Ting
AAAI
2006
15 years 5 months ago
Planning with First-Order Temporally Extended Goals using Heuristic Search
Temporally extended goals (TEGs) refer to properties that must hold over intermediate and/or final states of a plan. The problem of planning with TEGs is of renewed interest becau...
Jorge A. Baier, Sheila A. McIlraith
AAAI
1998
15 years 5 months ago
A Tractable Walsh Analysis of SAT and its Implications for Genetic Algorithms
Walsh Transforms measure all sources of nonlinear interactions for functions that have a bit representation. There can be exponentially many nonlinear interactions and exactly com...
Soraya B. Rana, Robert B. Heckendorn, L. Darrell W...