Abstract We incorporate externalities into the stable matching theory of two-sided markets. Extending classical substitutes condition to markets with externalities, we establish that matchings exist when agent choices satisfy substitutability. show substitutability is a necessary for existence in maximal-domain sense and provide characterization substitutable choice functions. In addition, exte...

Input-queued packet switches are more scalable than output-queued ones. However, due to HOL blocking, their throughput is poor. The Virtual Output Queueing (VOQ) switch architecture and several buffer schedulers have been proposed to overcome this problem. Among them, the class of iterative maximal matching algorithms, with a first example being Parallel Iterative Matching (PIM), which uses ran...

An image stored in image database systems is assumed to be associated with some content-based meta-data about that image, that is, information about objects in the image and absolute/relative spatial relationships among them. An image query for such an image database system can generally be handled in two ways: exact picture matching and approximate picture matching. In this paper we show the i...

Graph-based matching methods have been widely used in the areas of object recognition and stereo correspondence. In this paper, an algorithm to deal with segmentation errors in region-based matching is proposed, which consists of a preprocessing stage to the classical graph-based matching algorithm. Some regions are merged and included in the matching process in order to avoid the di!erences in...

One places dominoes on ann x n chessboard. Each domino must cover exactly two squares of the board and no two dominoes may overlap. The board is said to be full if there is no room for placing further dominoes (Fig. 1). The problem of clumsy packing is formulated as follows: what is the minimum number d(n) of dominoes lying on ann X n full board? In fact, the clumsy packing of dominoes can be v...

the most important factor in donor-recipient matching for hematopoietic stem cell transplantation is their hla typing. for many patients, we can not find a full-matched donor. in high risk patients, one locus  mismatched related donors are suitable alternatives. (1, 2) since the matching of patients and their siblings usually is based on low resolution hla typing, the matching of one locus mism...

On-Line Analytical Processing (OLAP) has become a crucial element of decision support systems. Since historical, summarized and consolidated data is used in OLAP, the concept of data cube is often used to provide multidimensional views for such information. Among range-aggregates that are typical operations over the data cube, we in this paper focus on efficient processing of range-MAX and rang...

The (∆+1)-coloring problem is a fundamental symmetry breaking problem in distributed computing. We give a new randomized coloring algorithm for (∆ + 1)-coloring running in O( √ log ∆) + 2O( √ log logn) rounds with probability 1 − 1/nΩ(1) in a graph with n nodes and maximum degree ∆. This implies that the (∆ + 1)-coloring problem is easier than the maximal independent set problem and the maximal...

A palindrome is a string that reads the same forward and backward. For a string x, let Pals(x) be the set of all maximal palindromes of x, where each maximal palindrome in Pals(x) is encoded by a pair (c, r) of its center c and its radius r. Given a text t of length n and a pattern p of length m, the palindrome pattern matching problem is to compute all positions i of t such that Pals(p) = Pals...