Patents by Inventor Michael Böhlen

Michael Böhlen has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • SYSTEMS AND METHODS FOR EFFICIENT TOP-k APPROXIMATE SUBTREE MATCHING
    Publication number: 20120254251
    Abstract: Systems and method for searching for approximate matches in a database of documents represented by a tree structure. A fast solution to the Top-k Approximate Subtree Matching Problem involves determining candidate subtrees which will be considered as possible matches to a query also represented by a tree structure. Once these candidate subtrees are found, a tree edit distance between each candidate subtree and the query tree is calculated. The results are then sorted to find those with the lowest tree edit distance.
    Type: Application
    Filed: March 2, 2012
    Publication date: October 4, 2012
    Applicant: THE GOVERNORS OF THE UNIVERSITY OF ALBERTA
    Inventors: Denilson Barbosa, Nikolaus Augsten, Michael Böhlen, Themis Palpanas