Sciweavers

2050 search results - page 158 / 410
» constraints 2010
Sort
View
MFCS
2010
Springer
13 years 8 months ago
Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems
For a finite set Γ of Boolean relations, Max Ones SAT(Γ) and Exact Ones SAT(Γ) are generalized satisfiability problems where every constraint relation is from Γ, and the task...
Stefan Kratsch, Dániel Marx, Magnus Wahlstr...
MICCAI
2010
Springer
13 years 8 months ago
Reconstructing Geometrically Consistent Tree Structures from Noisy Images
Abstract. We present a novel approach to fully automated reconstruction of tree structures in noisy 2D images. Unlike in earlier approaches, we explicitly handle crossovers and bif...
Engin Türetken, Christian Blum, Germán...
ORL
2010
56views more  ORL 2010»
13 years 8 months ago
On interval-subgradient and no-good cuts
Interval-gradient cuts are (nonlinear) valid inequalities for nonconvex NLPs defined for constraints g(x) ≤ 0 with g being continuously differentiable in a box [x, ¯x]. In th...
Claudia D'Ambrosio, Antonio Frangioni, Leo Liberti...
PPL
2010
118views more  PPL 2010»
13 years 8 months ago
Coping with Decoherence: Parallelizing the Quantum Fourier Transform
Rank-varying computational complexity describes those computations in which the complexity of executing each step is not a constant, but evolves throughout the computation as a fu...
Marius Nagy, Selim G. Akl
RSA
2010
81views more  RSA 2010»
13 years 8 months ago
Percolation of arbitrary words in one dimension
We consider a type of long-range percolation problem on the positive integers, motivated by earlier work of others on the appearance of (in)finite words within a site percolation...
Geoffrey R. Grimmett, Thomas M. Liggett, Thomas Ri...