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...

A many-to-many k-disjoint path cover of a graph joining two disjoint vertex sets S and T of equal size k is a set of k vertex-disjoint paths between S and T that altogether cover every vertex of the graph. The many-to-many k-disjoint path cover is classified as paired if each source in S is further required to be paired with a specific sink in T , or unpaired otherwise. In this paper, we first ...

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...

A new method for interpolating between presets is described. The interpolation algorithm called Intersecting N-Spheres Interpolation is simple to compute and its generalization to higher dimensions is straightforward. The current implementation in the SuperCollider environment is presented as a tool that eases the design of many-to-many mappings for musical interfaces. Examples of its uses, inc...

This paper considers the problemofmany-to-many disjoint paths in the hypercubeQn with f faulty vertices and obtains the following result. For any integer k with 1 ≤ k ≤ n − 1 and any two sets S and T of k fault-free vertices in different partite sets of Qn (n ≥ 2), if f ≤ 2n−2k−2 and each fault-free vertex has at least two fault-free neighbors, then there exist k fully disjoint fault-free paths...