Sciweavers

4137 search results - page 37 / 828
» On the number of matchings of a tree
Sort
View
CSREAPSC
2006
13 years 9 months ago
An Inexact Matching Method Based on Ontology and Semantic Distance for Resource Discovery and Interaction
- To overcome shortcomings of Exact Matching Method (EMM) and Substitute Description Method (SDM), an Inexact Matching Method Based on Ontology and Semantic Distance (OSDIMM) is in...
Tang Shancheng, Qian Yi, Wang Wei
JSYML
2011
71views more  JSYML 2011»
13 years 2 months ago
The club principle and the distributivity number
Abstract. We give an affirmative answer to Brendle’s and Hruˇs´ak’s question of whether the club principle together with h > ℵ1 is consistent. We work with a class of ax...
Heike Mildenberger
SCAM
2007
IEEE
14 years 2 months ago
Fast Approximate Matching of Programs for Protecting Libre/Open Source Software by Using Spatial Indexes
To encourage open source/libre software development, it is desirable to have tools that can help to identify open source license violations. This paper describes the implementatio...
Arnoldo José Müller Molina, Takeshi Sh...
FCT
2001
Springer
14 years 6 days ago
Polynomial Time Algorithms for Finding Unordered Tree Patterns with Internal Variables
Many documents such as Web documents or XML files have tree structures. A term tree is an unordered tree pattern consisting of internal variables and tree structures. In order to ...
Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miya...
ACL
2003
13 years 9 months ago
Finding Non-local Dependencies: Beyond Pattern Matching
We describe an algorithm for recovering non-local dependencies in syntactic dependency structures. The patternmatching approach proposed by Johnson (2002) for a similar task for p...
Valentin Jijkoun