4137 search results - page 88 / 828 » On the number of matchings of a tree |
151
click to vote
ECAI
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. Typical ontology matching applications, such as ontology integration, focus on the computation of correspondences holding between the nodes of two graph-like structures, ...
107
click to vote
MT
2006
15 years 1 months ago
2006
Abstract. This paper describes an example-based machine translation (EBMT) method based on tree-string correspondence (TSC) and statistical generation. In this method, the translat...
117
click to vote
CBSE
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. Searching and subsequently selecting reusable components from component repositories has become a key impediment for not only component-based development but also for ach...
102
click to vote
FCCM
2005
IEEE
15 years 7 months ago
2005
IEEE
In this paper, we introduce a novel architecture for a hardware based network intrusion detection system (NIDS). NIDSs are becoming critical components of the network infrastructu...
113
click to vote
ISAAC
1998
Springer
15 years 6 months ago
1998
Springer
In this paper we present a randomized parallel algorithm to sample matchings from an almost uniform distribution on the set of matchings of all sizes in a graph. First we prove th...