1326 search results - page 36 / 266 » Approximate Tree Kernels |
103
click to vote
DAC
2001
ACM
16 years 2 months ago
2001
ACM
This paper presents the concept of flexibility ? a geometric property associated with Steiner trees. Flexibility is related to the routability of the Steiner tree. We present an o...
117
click to vote
IJCAI
2007
15 years 3 months ago
2007
In recent years, metric learning in the semisupervised setting has aroused a lot of research interests. One type of semi-supervised metric learning utilizes supervisory informatio...
123
click to vote
ACID
2006
15 years 3 months ago
2006
The Convex Recoloring (CR) problem measures how far a tree of characters differs from exhibiting a so-called "perfect phylogeny". For input consisting of a vertex-colored...
107
click to vote
ICRA
1999
IEEE
15 years 6 months ago
1999
IEEE
Mobile robot localization is the problem of determining a robot's pose from sensor data. This article presents a family of probabilisticlocalization algorithms known as Monte...
110
click to vote
FOCS
2004
IEEE
15 years 5 months ago
2004
IEEE
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...