1326 search results - page 153 / 266 » Approximate Tree Kernels |
NIPS
2003
13 years 11 months ago
2003
Rao–Blackwellization is an approximation technique for probabilistic inference that flexibly combines exact inference with sampling. It is useful in models where conditioning o...
IWANN
2005
Springer
14 years 3 months ago
2005
Springer
Based on the Nystr¨om approximation and the primal-dual formulation of Least Squares Support Vector Machines (LS-SVM), it becomes possible to apply a nonlinear model to a large sc...
ECCV
2010
Springer
14 years 3 months ago
2010
Springer
Abstract. We present a novel single image deblurring method to estimate spatially non-uniform blur that results from camera shake. We use existing spatially invariant deconvolution...
ACCV
2010
Springer
13 years 4 months ago
2010
Springer
Detecting instances of unknown categories is an important task for a multitude of problems such as object recognition, event detection, and defect localization. This paper investig...
SPAA
2004
ACM
14 years 3 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...