We propose a simple yet very predictive form, based on a Poisson's equation, for the functional dependence of the cost from the density of points in the Euclidean bipartite matching problem. This leads, for quadratic costs, to the analytic prediction of the large N limit of the average cost in dimension d = 1,2 and of the subleading correction in higher dimension. A nontrivial scaling exponent,...

Although experimental tests have not tended to support the matching hypothesis, correlational studies have consistently found positive intracouple attractiveness correlations among actual couples. The present investigation sought to reconcile the findings of experimental and correlational studies by probing the relation between individual choices and systemwide patterns of couple formation. Thi...

Title of Document: PERSONAL GROWTH INITIATIVE AS A MODERATOR OF EXPRESSIVE WRITING TASKS: TEST OF A MATCHING HYPOTHESIS Helena (Mimi) Martin, Master of Arts, 2009 Directed By: Dr. Robert W. Lent, Counseling and Personnel Services Department This study advances knowledge regarding a new potential client variable moderator to therapeutic writing. Therapeutic writing, also referred to in the liter...

We study the fine-grained complexity of Leader Contributor Reachability (LCR) and Bounded-Stage Reachability (BSR), two variants of the safety verification problem for shared memory concurrent programs. For both problems, the memory is a single variable over a finite data domain. We contribute new verification algorithms and lower bounds based on the Exponential Time Hypothesis (ETH) and kernel...

ontology is the main infrastructure of the semantic web which provides facilities for integration, searching and sharing of information on the web. development of ontologies as the basis of semantic web and their heterogeneities have led to the existence of ontology matching. by emerging large-scale ontologies in real domain, the ontology matching systems faced with some problem like memory con...

Abstract. Applications for video data recorded with a setup of several cameras are currently attracting increasing interest. For such multi-view sequences, efficient coding is crucial to handle the enormous amount of data. However, significant luminance and chrominance variations between the different views, which often originate from imperfect camera calibration, are able to reduce the coding ...

We devise a framework for proving tight lower bounds under the counting exponential-time hypothesis #ETH introduced by Dell et al. (ACM Transactions on Algorithms, 2014). Our framework allows us to convert classical #P-hardness results for counting problems into tight lower bounds under #ETH, thus ruling out algorithms with running time 2o(n) on graphs with n vertices and O(n) edges. As exempla...

We study two-sided (“marriage”) and general pairing (“roommate”) problems. We introduce “sequences,” lists of matchings that are repeated in order. Stable sequences are natural extensions of stable matchings; case in point, we show that a sequence of stable matchings is stable. In addition, stable sequences can provide solutions to problems for which stable matchings do not exist. In a sense, t...

One hypothesis for the function of vocal repertoires in songbirds is that singing multiple song types facilitates song matching, a behaviour in which one male replies to a rival’s song with a song of the same type. In eastern populations of song sparrows, low levels of whole song sharing restrict opportunities for matching of entire song types. A male in this population might still match a neig...