1326 search results - page 110 / 266 » Approximate Tree Kernels |
CPM
1999
Springer
14 years 1 months ago
1999
Springer
We present a new indexing method for the approximate string matching problem. The method is based on a su x tree combined with a partitioning of the pattern. We analyze the resulti...
JMLR
2010
13 years 3 months ago
2010
The FastInf C++ library is designed to perform memory and time efficient approximate inference in large-scale discrete undirected graphical models. The focus of the library is pro...
EACL
2006
ACL Anthology
13 years 10 months ago
2006
ACL Anthology
In this paper we extend the maximum spanning tree (MST) dependency parsing framework of McDonald et al. (2005c) to incorporate higher-order feature representations and allow depen...
DAM
2006
13 years 8 months ago
2006
Subtree filament graphs are the intersection graphs of subtree filaments in a tree. This class of graphs contains subtree overlap graphs, interval filament graphs, chordal graphs,...
IPL
2002
13 years 8 months ago
2002
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...