1326 search results - page 134 / 266 » Approximate Tree Kernels |
ISAAC
2003
Springer
14 years 2 months ago
2003
Springer
Abstract Given an edge-weighted transportation network G and a list of transportation requests L, the Stacker Crane Problem is to find a minimum-cost tour for a server along the e...
COCOON
1999
Springer
14 years 1 months ago
1999
Springer
Scheduling jobs with pairwise conflicts is modeled by the graph multicoloring problem. It occurs in two versions: in the preemptive case, each vertex may get any set of colors, w...
NIPS
2008
13 years 11 months ago
2008
The Singular Value Decomposition is a key operation in many machine learning methods. Its computational cost, however, makes it unscalable and impractical for applications involvi...
TALG
2008
13 years 9 months ago
2008
We introduce a new notion of embedding, called minimum-relaxation ordinal embedding, parallel to the standard notion of minimum-distortion (metric) embedding. In an ordinal embedd...
ICIP
2002
IEEE
14 years 11 months ago
2002
IEEE
We describe a method for inferring tree-like vascular structures from 2D imagery. A Markov Chain Monte Carlo (MCMC) algorithm is employed to produce approximate samples from the p...