440 search results - page 23 / 88 » Partial Matching by Structural Descriptors |
CVPR
1997
IEEE
13 years 11 months ago
1997
IEEE
In this paper we focus on using local 3D structure for segmentation. A tensor descriptor is estimated for each neighbourhood, i.e. for each voxel in the data set. The tensors are ...
PKDD
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. In this paper, we present an extensive study of the cuttingplane algorithm (CPA) applied to structural kernels for advanced text classification on large datasets. In par...
ICALP
2011
Springer
12 years 11 months ago
2011
Springer
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
CVPR
2010
IEEE
14 years 4 months ago
2010
IEEE
In matching tasks in computer vision, and particularly in real-time tracking from video, there are generally strong priors available on absolute and relative correspondence locati...
DCC
2006
IEEE
14 years 7 months ago
2006
IEEE
Abstract. We propose measures for compressed data structures, in which space usage is measured in a data-aware manner. In particular, we consider the fundamental dictionary problem...