Different auction-based approaches have been used to allocate resources in Grids, but none of them provide the design choice for a specific economic model while considering the interest of all participants in the market. In this paper, we implement an auction-based framework for producer and consumer matchmaking in an ad-hoc Grid. In ad-hoc Grids, where the availability of resources and tasks i...

The ambiguity of natural language can be an important source of creative concepts. In compositional languages, a many-to-many network of associations exists linking concepts by the polysemy and synonymy of utterances. This network allows utterances to represent the combination of concepts, forming new and potentially interesting compound meanings. At the same time, new experiences of external a...

Let A = {a1, a2, . . . , as} and {b1, b2, . . . , bt} with s+r = n, the many to many point matching with demands and capacities matches each point ai ∈ A to at least αi and at most α ′ i points in B, and each point bj ∈ B to at least βj and at most β ′j points in A for all 1 ≤ i ≤ s and 1 ≤ j ≤ t. In this paper, we present an O(n) time and O(n) space algorithm for this problem.

An early motivation for Synchronous TAG (Shieber and Schabes, 1990) (S-TAG) was machine translation (Abeillé, Schabes and Joshi, 1990). Abeillé et al note that traditionally difficult problems outlined by Dorr (1994)—for example, categorial, thematic, conflational, structural and lexical divergences—have been used to argue for the necessity of an explicit semantic representation. However, many ...

To navigate many-to-many mappings between referents and linguistic expressions, listeners need to calibrate likelihood estimates for different referential expressions taking into account both the context and speaker-specific variation. Focusing on speaker variation, we present three experiments. Experiment 1 establishes that listeners generalize speakerspecific patterns of pre-nominal modificat...

One of the bottlenecks of current recognition (and graph matching) systems is their assumption of one-to-one feature (node) correspondence. This assumption breaks down in the generic object recognition task where, for example, a collection of features at one scale (in one image) may correspond to a single feature at a coarser scale (in the second image). Generic object recognition therefore req...