3731 search results - page 107 / 747 » cases 2006 |
104
Voted
ORL
1998
15 years 8 days ago
1998
Crowder et al. (Oper. Res. 31 (1983) 803–834) conjectured that the separation problem for cover inequalities for binary integer programs is polynomially solvable. We show that t...
85
Voted
NA
2007
15 years 4 days ago
2007
Inequalities are conjectured for the Jacobi polynomials P (α,β) n and their largest zeros. Special attention is given to the cases β = α − 1 and β = α. Key words. Jacobi po...
94
Voted
JMIV
2010
14 years 11 months ago
2010
Motivated by the setting of reproducing kernel Hilbert space (RKHS) and its extensions considered in machine learning, we propose an RKHS framework for image and video colorizatio...
125
Voted
KES
2006
Springer
15 years 17 days ago
2006
Springer
Abstract. The aim of this work is to forecast future events in financial data sets, in particular, we focus our attention on situations where positive instances are rare, which fal...
112
Voted
ANTS
2006
Springer
15 years 4 months ago
2006
Springer
Despite their popularity, lattice reduction algorithms remain mysterious in many ways. It has been widely reported that they behave much more nicely than what was expected from the...