1326 search results - page 32 / 266 » Approximate Tree Kernels |
ISVC
2007
Springer
14 years 2 months ago
2007
Springer
Schlick’s approximation of the term xp is used primarily to reduce the complexity of specular lighting calculations in graphics applications. Since moment functions have a kernel...
NETWORKS
2006
13 years 8 months ago
2006
Abstract. The Steiner tree problem is to find a shortest subgraph that spans a given set of vertices in a graph. This problem is known to be NP-hard and it is well known that a pol...
STOC
2010
ACM
14 years 1 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
3DIM
2003
IEEE
14 years 8 days ago
2003
IEEE
A method is presented that uses an Approximate Nearest Neighbor method for determining correspondences within the Iterative Closest Point Algorithm. The method is based upon the k...
ICPR
2004
IEEE
14 years 9 months ago
2004
IEEE
Kernel logistic regression models, like their linear counterparts, can be trained using the efficient iteratively reweighted least-squares (IRWLS) algorithm. This approach suggest...