Sciweavers

79 search results - page 6 / 16
» The pq-gram distance between ordered labeled trees
Sort
View
SIROCCO
2007
13 years 9 months ago
Labeling Schemes with Queries
Recently, quite a few papers studied methods for representing network properties by assigning informative labels to the vertices of a network. Consulting the labels given to any t...
Amos Korman, Shay Kutten
CPM
2006
Springer
143views Combinatorics» more  CPM 2006»
13 years 11 months ago
Algorithms for Finding a Most Similar Subforest
Given an ordered labeled forest F ("the target forest") and an ordered labeled forest G ("the pattern forest"), the most similar subforest problem is to find a ...
Jesper Jansson, Zeshan Peng
SSDBM
2002
IEEE
122views Database» more  SSDBM 2002»
14 years 16 days ago
ATreeGrep: Approximate Searching in Unordered Trees
An unordered labeled tree is a tree in which each node has a string label and the parent-child relationship is significant, but the order among siblings is unimportant. This pape...
Dennis Shasha, Jason Tsong-Li Wang, Huiyuan Shan, ...
ICALP
1998
Springer
13 years 12 months ago
Constraint Automata and the Complexity of Recursive Subtype Entailment
Abstract. We study entailment of structural and nonstructural recursive subtyping constraints. Constraints are formal inequalities between type expressions, interpreted over an ord...
Fritz Henglein, Jakob Rehof
ICASSP
2011
IEEE
12 years 11 months ago
Semi-supervised handwritten digit recognition using very few labeled data
We propose a novel semi-supervised classifier for handwritten digit recognition problems that is based on the assumption that any digit can be obtained as a slight transformation...
Steven Van Vaerenbergh, Ignacio Santamaría,...