We investigate the use of background knowledge ontology in ontology matching. We conducted experiments on matching two medical ontologies using third extensive one as background knowledge, and compare it to the direct match. Our results indicate that using background knowledge, in particular exploitation of its structure, has enormous benefit in the matching. The semantics of knowledge within t...

Absbactvirtual Output Queuing is widely used by fixedlength high-speed switches to overcome head-of-line blocking. This is done by means of matching algorithms. M a x i " matching algorithms have good performance, hut their implementation complexity is quite high. Maximal matching algorith~ns need speedup to guarantee good performance. Iterative algorithms (such as PIM and ISLIP) use multiple i...

Virtual Output Queuing is widely used by fixed-length highspeed switches to overcome head-of-line blocking. This is done by means of matching algorithms. Maximum matching algorithms have good performance, but their implementation complexity is quite high. Maximal matching algorithms need speedup to guarantee good performance. Iterative algorithms (such as PIM and iSLIP) use multiple iterations ...

By prior work, there is a distributed graph algorithm that finds a maximal fractional matching (maximal edge packing) in O(∆) rounds, independently of n; here ∆ is the maximum degree of the graph and n is the number of nodes in the graph. We show that this is optimal: there is no distributed algorithm that finds a maximal fractional matching in o(∆) rounds, independently of n. Our work gives th...

This paper presents the first sublinear-time deterministic parallel algorithms fix bipartite matching and several related problems, including maximal node-disjoint paths, depth-first search, and flows in zero-one networks. Our results are based on a better understanding of the combinatorial structure of the above problems, which leads to new algorithmic techniques. In particular, we show how to...

Scheduling algorithms for input-queued switches have been widely researched. It has been shown that various classes of scheduling algorithms guarantee the stability of single switches. However, recent research has demonstrated that most of these scheduling algorithms do not the guarantee stability for networks of switches. Most of the research that treats networks of switches proposes switching...

We consider two models of computation: centralized local algorithms and local distributed algorithms. Algorithms in one model are adapted to the other model to obtain improved algorithms. Distributed vertex coloring is employed to design improved centralized local algorithms for: maximal independent set, maximal matching, and an approximation scheme for maximum (weighted) matching over bounded ...

We present a self-stabilizing algorithm for finding a generalized maximal matching ( -matching) in an arbitrary distributed network. We show that the algorithm converges in moves under an unfair central demon independent of the -values at different nodes. The algorithm is capable of working with multiple types of demons (schedulers) as is the most recent algorithm in [1, 2].

We provide self-stabilizing algorithms to obtain and maintain a maximal matching, maximal independent set or minimal dominating set in a given system graph. They converge in linear rounds under a distributed or synchronous daemon. They can be implemented in an ad hoc network by piggy-backing on the beacon messages that nodes already use.