Sciweavers

1421 search results - page 39 / 285
» Satisfying KBO Constraints
Sort
View
MFCS
2010
Springer
13 years 6 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...
RSA
2010
81views more  RSA 2010»
13 years 6 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...
ORL
2010
158views more  ORL 2010»
13 years 2 months ago
Constructing fair round robin tournaments with a minimum number of breaks
Given n clubs with two teams each, we show that, if n is even, it is possible to construct a schedule for a single round robin tournament satisfying the following properties: the ...
Pim van 't Hof, Gerhard F. Post, Dirk Briskorn
IJCV
2000
110views more  IJCV 2000»
13 years 8 months ago
A Parametric Texture Model Based on Joint Statistics of Complex Wavelet Coefficients
We present a universal statistical model for texture images in the context of an overcomplete complex wavelet transform. The model is parameterized by a set of statistics computed ...
Javier Portilla, Eero P. Simoncelli
AUTOMATICA
2010
98views more  AUTOMATICA 2010»
13 years 7 months ago
Explicit use of probabilistic distributions in linear predictive control
: The guarantee of feasibility given feasibility at initial time is an issue that has been overlooked by many of the recent papers on stochastic model predictive control. Effective...
Basil Kouvaritakis, Mark Cannon, Sasa V. Rakovic, ...