Sciweavers

7796 search results - page 36 / 1560
» On Generalized Schur Numbers
Sort
View
COMBINATORICS
1999
83views more  COMBINATORICS 1999»
13 years 9 months ago
New Lower Bounds for Some Multicolored Ramsey Numbers
In this article we use two different methods to find new lower bounds for some multicolored Ramsey numbers. In the first part we use the finite field method used by Greenwood and ...
Aaron Robertson
DM
1999
79views more  DM 1999»
13 years 9 months ago
A bijective proof of Riordan's theorem on powers of Fibonacci numbers
Let Fk(x) = n=0 Fk n xn . Using the interpretation of Fibonacci numbers in the terms of Morse codes, we give a bijective proof of Riordan's formula (1 - Lkx + (-1)k x2 )Fk(x...
Andrej Dujella
IEEEIAS
2007
IEEE
14 years 4 months ago
An LSB Data Hiding Technique Using Prime Numbers
In this paper, a novel data hiding technique is proposed, as an improvement over the Fibonacci LSB data-hiding technique proposed by Battisti et al. [1]. First we mathematically m...
Sandipan Dey, Ajith Abraham, Sugata Sanyal
COLT
1999
Springer
14 years 2 months ago
Covering Numbers for Support Vector Machines
—Support vector (SV) machines are linear classifiers that use the maximum margin hyperplane in a feature space defined by a kernel function. Until recently, the only bounds on th...
Ying Guo, Peter L. Bartlett, John Shawe-Taylor, Ro...
IPCO
2007
126views Optimization» more  IPCO 2007»
13 years 11 months ago
The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
Abstract. A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind ...
René Beier, Heiko Röglin, Berthold V&o...