664 search results - page 32 / 133 » Some results for a class of generalized polynomials |
CORR
2010
Springer
14 years 7 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
81
Voted
CAI
2009
Springer
15 years 4 months ago
2009
Springer
The aim of this paper is to collect definitions and results on the main classes of 2D languages introduced with the attempt of generalizing regular and context-free string languag...
67
Voted
ECAI
2004
Springer
15 years 3 months ago
2004
Springer
The standard SVM formulation for binary classification is based on the Hinge loss function, where errors are considered not correlated. Due to this, local information in the featu...
AAAI
2008
15 years 11 hour ago
2008
Currently, the most effective complete SAT solvers are based on the DPLL algorithm augmented by clause learning. These solvers can handle many real-world problems from application...
106
click to vote
LICS
2012
IEEE
13 years 2 days ago
2012
IEEE
Abstract—We investigate some basic questions about the interaction of regular and rational relations on words. The primary motivation comes from the study of logics for querying ...