1172 search results - page 65 / 235 » Constructions of generalized Sidon sets |
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
We describe a method for generating accurate, compact, human understandable text classifiers. Text datasets are indexed using Apache Lucene and Genetic Programs are used to constr...
PKDD
2005
Springer
15 years 5 months ago
2005
Springer
Imbalanced data learning has recently begun to receive much attention from research and industrial communities as traditional machine learners no longer give satisfactory results. ...
108
click to vote
ICLP
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. In this paper we consider a logic programming framework for reasoning about imprecise probabilities. In particular, we propose a new semantics, for the Probabilistic Logi...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on...
105
click to vote
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
The maximization of a positive (semi)definite complex quadratic form over a finite alphabet is NP-hard and achieved through exhaustive search when the form has full rank. Howeve...