Sciweavers

1132 search results - page 35 / 227
» Upper and lower Ramsey bounds in bounded arithmetic
Sort
View
TCS
2011
13 years 2 months ago
Bounds for the generalized repetition threshold
The notion of repetition threshold, which is the object of Dejean’s conjecture (1972), was generalized by Ilie, Ochem, and Shallit in 2005, to include the lengths of the avoided ...
Francesca Fiorenzi, Pascal Ochem, Elise Vaslet
IWPEC
2009
Springer
14 years 1 months ago
A Probabilistic Approach to Problems Parameterized above or below Tight Bounds
We introduce a new approach for establishing fixed-parameter tractability of problems parameterized above tight lower bounds or below tight upper bounds. To illustrate the approac...
Gregory Gutin, Eun Jung Kim, Stefan Szeider, Ander...
CORR
2012
Springer
198views Education» more  CORR 2012»
12 years 3 months ago
Lipschitz Parametrization of Probabilistic Graphical Models
We show that the log-likelihood of several probabilistic graphical models is Lipschitz continuous with respect to the ￿p-norm of the parameters. We discuss several implications ...
Jean Honorio
COMPGEOM
2010
ACM
14 years 15 days ago
Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen
STOC
2003
ACM
110views Algorithms» more  STOC 2003»
14 years 7 months ago
New degree bounds for polynomial threshold functions
A real multivariate polynomial p(x1, . . . , xn) is said to sign-represent a Boolean function f : {0, 1}n {-1, 1} if the sign of p(x) equals f(x) for all inputs x {0, 1}n. We gi...
Ryan O'Donnell, Rocco A. Servedio