Sciweavers

558 search results - page 13 / 112

» Trees and Matchings

149

WADS
1995
Springer

78views Algorithms» more WADS 1995»

Routing on Trees via Matchings

15 years 10 months ago

Routing on Trees via Matchings

Download www.it.usyd.edu.au

Alan Roberts, Antonios Symvonis, Louxin Zhang

claim paper

Read More »

135

VISAPP
2008

179views Computer Vision» more VISAPP 2008»

Simple but Effective Tree Structures for Dynamic Programming-Based Stereo Matching

15 years 8 months ago

Simple but Effective Tree Structures for Dynamic Programming-Based Stereo Matching

Download www.ims.tuwien.ac.at

Michael Bleyer, Margrit Gelautz

claim paper

Read More »

142

SEBD
2004

86views Database» more SEBD 2004»

Unordered XML Pattern Matching with Tree Signatures

15 years 8 months ago

Unordered XML Pattern Matching with Tree Signatures

Download www.isgroup.unimo.it

Federica Mandreoli, Riccardo Martoglia, Pavel Zezu...

claim paper

Read More »

118

EJC
2010

95views Information Technology» more EJC 2010»

Klazar trees and perfect matchings

15 years 6 months ago

Klazar trees and perfect matchings

Download www.stat.wisc.edu

David Callan

claim paper

Read More »

133

ICDE
2010
IEEE

371views Database» more ICDE 2010»

TASM: Top-k Approximate Subtree Matching

16 years 6 months ago

TASM: Top-k Approximate Subtree Matching

Download www.inf.unibz.it

Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...

Nikolaus Augsten, Denilson Barbosa, Michael H. B&o...

claim paper

Read More »

« Prev « First page 13 / 112 Last » Next »