A novel face recognition method is proposed, in which face images are represented by a set of local labeled graphs, each containing information about the appearance and geometry of a 3-tuple of face feature points, extracted using Local Feature Analysis (LFA) technique. Our method automatically learns a model set and builds a graph space for each individual. A two-stage method for optimal match...

In this paper, we consider the pattern matching problem in DNA and RNA sequences where either the pattern or the text can be degenerate i.e. contain sets of characters. We present an asymptotically faster algorithm for the above problem that works in O(n logm) time, where n and m is the length of the text and the pattern respectively. We also suggest an efficient implementation of our algorithm...

In this paper, we consider the pattern matching problem in DNA and RNA sequences where either the pattern or the text can be degenerate i.e. contain sets of characters. We present an asymptotically faster algorithm for the above problem that works in O(n logm) time, where n and m is the length of the text and the pattern respectively. We also suggest an efficient implementation of our algorithm...

We prove the first non-trivial performance ratios strictly above 0.5 for weighted versions of the oblivious matching problem. Even for the unweighted version, since Aronson, Dyer, Frieze, and Suen first proved a non-trivial ratio above 0.5 in the mid-1990s, during the next twenty years several attempts have been made to improve this ratio, until Chan, Chen, Wu and Zhao successfully achieved a s...

auctions have been as a competitive method of buying and selling valuable or rare items for a long time. single-sided auctions in which participants negotiate on a single attribute (e.g. price) are very popular. double auctions and negotiation on multiple attributes create more advantages compared to single-sided and single-attribute auctions. nonetheless, this adds the complexity of the auctio...

We study Pareto optimal matchings in the context of house allocation problems. We present an O( √ nm) algorithm, based on Gale’s Top Trading Cycles Method, for finding a maximum cardinality Pareto optimal matching, where n is the number of agents and m is the total length of the preference lists. By contrast, we show that the problem of finding a minimum cardinality Pareto optimal matching is N...

Is the Pareto optimality of matching mechanisms robust to the introduction of boundedly rational behavior? To address this question I define a restrictive and a permissive notion of Pareto optimality and consider the large set of hierarchical exchange mechanisms which contains serial dictatorship as well as Gale’s top trading cycles. Fix a housing problem with boundedly rational agents and a hi...

This paper studies a decentralized job market model where firms (academic departments) propose sequentially a (unique) position to some workers (Ph.D. candidates). Successful candidates then decide whether to accept the offers, and departments whose positions remain unfilled propose to other candidates. We distinguish between several cases, depending on whether agents’ actions are simultaneous ...

Propensity score applications are often used to evaluate educational program impact. However, various options are available to estimate both propensity scores and construct comparison groups. This study used a student achievement dataset with commonly available covariates to compare different propensity scoring estimation methods (logistic regression, boosted regression, and Bayesian logistic r...