14165 search results - page 110 / 2833 » The generalized two-server problem |
198
click to vote
ICIP
2008
IEEE
15 years 10 months ago
2008
IEEE
In previous work, we developed the Illum-PF-MT, which is the PFMT idea applied to the problem of tracking temporally and spatially varying illumination change. In many practical p...
132
click to vote
IPPS
1997
IEEE
15 years 8 months ago
1997
IEEE
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
JETAI
2002
15 years 3 months ago
2002
We outline the rationale and preliminary results of using the State Context Property (SCOP) formalism, originally developed as a generalization of quantum mechanics, to describe t...
120
click to vote
NECO
2010
15 years 2 months ago
2010
In this paper we develop a novel generalization bound for learning the kernel problem. First, we show that the generalization analysis of the kernel learning problem reduces to in...