8141 search results - page 233 / 1629 » Higher Order Generalization |
158
click to vote
ICNC
2005
Springer
15 years 10 months ago
2005
Springer
In order to overcome the drawbacks of mathematical optimization techniques, soft computing algorithms have been vigorously introduced during the past decade. However, there are sti...
121
click to vote
ISAAC
2004
Springer
15 years 10 months ago
2004
Springer
A semimagic square of order n is an n ¢n matrix containing the integers 0 n2 1 arranged in such a way that each row and column add up to the same value. We generalize this notio...
141
click to vote
SAC
2010
ACM
15 years 10 months ago
2010
ACM
Numerous privacy models based on the k-anonymity property have been introduced in the last few years. While differing in their methods and quality of their results, they all focus...
140
click to vote
COLT
2001
Springer
15 years 9 months ago
2001
Springer
We consider geometric conditions on a labeled data set which guarantee that boosting algorithms work well when linear classifiers are used as weak learners. We start by providing ...
145
Voted
CP
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. Computing lower bounds to the best-cost extension of a tuple is an ubiquous task in constraint optimization. A particular case of special interest is the computation of l...