Two-sided matchings are an important theoretical tool used to model markets and social interactions. In many real life problems the utility of an agent is influenced not only by their own choices, but also by the choices that other agents make. Such an influence is called an externality. Whereas fully expressive representations of externalities in matchings require exponential space, in this pa...

DEFINITION As stated in the entry “Publish/Subscribe over Streams”, publish/subscribe (pub/sub) is a many-to-many communication model that directs the flow of messages from senders to receivers based on receivers’ data interests. In this model, publishers (i.e., senders) generate messages without knowing their receivers; subscribers (who are potential receivers) express their data interests, an...

Weblogs have recently emerged as a popular means of sharing information on the Web. While they effectively foster the networking of participants on a one-to-one basis, so far they have been lacking the capacity of allowing the establishment of many-to-many communication relationships. This paper describes recent work on facilitating group-forming processes and the sharing of content among weblo...

We present DIRECTL: an online discriminative sequence prediction model that employs a many-to-many alignment between target and source. Our system incorporates input segmentation, target character prediction, and sequence modeling in a unified dynamic programming framework. Experimental results suggest that DIRECTL is able to independently discover many of the language-specific regularities in ...

Let A and B be two finite sets of points with total cardinality 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 upper bound for this problem using our new polynomial time algorithm.

Postcode 06560 City Sogutozu State Ankara Country Turkey Author Degree Dr.

A k-disjoint path cover of a graph is a set of k internally vertex-disjoint paths which cover the vertex set with k paths and each of which runs between a source and a sink. Given that each source and sink v is associated with an integer-valued demand d(v) ≥ 1, we are concerned with general-demand k-disjoint path cover in which every source and sink v is contained in the d(v) paths. In this pap...