Sciweavers

4137 search results - page 33 / 828
» On the number of matchings of a tree
Sort
View
MMM
2009
Springer
93views Multimedia» more  MMM 2009»
14 years 4 months ago
SenseCam Image Localisation Using Hierarchical SURF Trees
The SenseCam is a wearable camera that automatically takes photos of the wearer’s activities, generating thousands of images per day. Automatically organising these images for e...
Ciarán O. Conaire, Michael Blighe, Noel E. ...
WDAG
2004
Springer
130views Algorithms» more  WDAG 2004»
14 years 1 months ago
Distributed Weighted Matching
Abstract. In this paper, we present fast and fully distributed algorithms for matching in weighted trees and general weighted graphs. The time complexity as well as the approximati...
Mirjam Wattenhofer, Roger Wattenhofer
ICDE
2010
IEEE
371views Database» more  ICDE 2010»
14 years 7 months ago
TASM: Top-k Approximate Subtree Matching
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...
COCOON
2007
Springer
14 years 1 months ago
On the Complexity of Finding an Unknown Cut Via Vertex Queries
We investigate the problem of finding an unknown cut through querying vertices of a graph G. Our complexity measure is the number of submitted queries. To avoid some worst cases, ...
Peyman Afshani, Ehsan Chiniforooshan, Reza Dorrigi...
ACL
2007
13 years 9 months ago
A Grammar-driven Convolution Tree Kernel for Semantic Role Classification
Convolution tree kernel has shown promising results in semantic role classification. However, it only carries out hard matching, which may lead to over-fitting and less accurate s...
Min Zhang, Wanxiang Che, AiTi Aw, Chew Lim Tan, Gu...