1326 search results - page 85 / 266 » Approximate Tree Kernels |
JDA
2006
13 years 8 months ago
2006
We prove that the pathwidth of Halin graphs can be 3-approximated in linear time. Our approximation algorithms is based on a combinatorial result about respectful edge orderings o...
FOCS
2003
IEEE
14 years 2 months ago
2003
IEEE
We give improved approximation algorithms for a variety of latency minimization problems. In particular, we give a 3.591 -approximation to the minimum latency problem, improving o...
ICIP
2005
IEEE
14 years 10 months ago
2005
IEEE
Robustly tracking moving objects in video sequences is one of the key problems in computer vision. In this paper we introduce a computationally efficient nonlinear kernel learning...
CIMAGING
2008
13 years 10 months ago
2008
The Non-Local Means (NLM) method of denoising has received considerable attention in the image processing community due to its performance, despite its simplicity. In this paper, ...
NIPS
2008
13 years 10 months ago
2008
We consider the problem of multiple kernel learning (MKL), which can be formulated as a convex-concave problem. In the past, two efficient methods, i.e., Semi-Infinite Linear Prog...