1326 search results - page 80 / 266 » Approximate Tree Kernels |
SODA
2000
ACM
13 years 10 months ago
2000
ACM
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
IPL
2007
13 years 8 months ago
2007
Given a metric graph G, we are concerned with finding a spanning tree of G where the maximum weighted degree of its vertices is minimum. In a metric graph (or its spanning tree),...
ECML
2006
Springer
14 years 13 days ago
2006
Springer
Abstract. Conditional Random Fields (CRFs) provide a powerful instrument for labeling sequences. So far, however, CRFs have only been considered for labeling sequences over flat al...
NHM
2010
13 years 3 months ago
2010
We propose here a general framework to address the question of trace operators on a dyadic tree. This work is motivated by the modeling of the human bronchial tree which, thanks t...
CVPR
2009
IEEE
15 years 3 months ago
2009
IEEE
In this paper we present a novel face classification system
where we represent face images as a spatial arrangement
of image patches, and seek a smooth non-linear functional
map...