1326 search results - page 178 / 266 » Approximate Tree Kernels |
157
Voted
COMPGEOM
2008
ACM
15 years 4 months ago
2008
ACM
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
134
Voted
SIAMCOMP
2010
15 years 29 days ago
2010
Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...
121
click to vote
STACS
2010
Springer
15 years 9 months ago
2010
Springer
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
137
Voted
CVPR
2008
IEEE
16 years 4 months ago
2008
IEEE
To learn a new visual category from few examples, prior knowledge from unlabeled data as well as previous related categories may be useful. We develop a new method for transfer le...
130
Voted
VIS
2005
IEEE
16 years 3 months ago
2005
IEEE
In this paper a novel high-quality reconstruction scheme is presented. Although our method is mainly proposed to reconstruct volumetric data sampled on an optimal Body-Centered Cu...