1871 search results - page 48 / 375 » The Ephemeral Pairing Problem |
142
click to vote
COCOA
2007
Springer
16 years 14 days ago
2007
Springer
We consider the problem of connecting given vertex pairs over a stochastic metric graph, each vertex of which has a probability of presence independently of all other ver
127
click to vote
LREC
2008
15 years 7 months ago
2008
This paper proposes a method of increasing the size of a bilingual lexicon obtained from two other bilingual lexicons via a pivot language. When we apply this approach, there are ...
158
click to vote
TWC
2010
15 years 29 days ago
2010
We consider a multiuser two-way relay network where multiple pairs of users exchange information with the assistance of a relay node, using orthogonal channels per pair. For a vari...
156
click to vote
FOCS
1996
IEEE
15 years 10 months ago
1996
IEEE
In the minimum path coloring problem, we are given a list of pairs of vertices of a graph. We are asked to connect each pair by a colored path. Paths of the same color must be edg...
161
click to vote
IANDC
2008
15 years 6 months ago
2008
We consider a natural resource allocation problem in which we are given a set of items, where each item has a list of pairs associated with it. Each pair is a configuration of an a...