777 search results - page 11 / 156 » A fast algorithm for the computation of an upper bound on th... |
TCS
1998
13 years 7 months ago
1998
The notion of treewidth has seen to be a powerful vehicle for many graph algorithmic studies. This survey paper wants to give an overview of many classes of graphs that can be see...
MFCS
2004
Springer
14 years 25 days ago
2004
Springer
We study the on-line versions of two fundamental graph problems, maximum independent set and minimum coloring, for the case of disk graphs which are graphs resulting from intersect...
SODA
2000
ACM
13 years 8 months ago
2000
ACM
We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimat...
ICCV
2001
IEEE
14 years 9 months ago
2001
IEEE
IJCAI
2007
13 years 9 months ago
2007
We propose a novel variant of the conjugate gradient algorithm, Kernel Conjugate Gradient (KCG), designed to speed up learning for kernel machines with differentiable loss functio...