2654 search results - page 214 / 531 » On Pairing Inversion Problems |
157
click to vote
ICPP
1998
IEEE
15 years 10 months ago
1998
IEEE
The crew planning problem has been successfully solved on a loosely connected network of workstations (NOW) using advanced computational techniques and efficient communication pat...
171
click to vote
WG
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. In random geometric graphs, vertices are randomly distributed on [0, 1]2 and pairs of vertices are connected by edges whenever they are sufficiently close together. Layou...
155
click to vote
STOC
1990
ACM
15 years 10 months ago
1990
ACM
We present randomized algorithms for two sorting problems. In the local sorting problem, a graph is given in which each vertex is assigned an element of a total order, and the task...
134
click to vote
LREC
2010
15 years 8 months ago
2010
This paper deals with the main problems that arise in the query translation process in dictionary-based Cross-lingual Information Retrieval (CLIR): translation selection, presence...
158
click to vote
SODA
2004
ACM
15 years 7 months ago
2004
ACM
Given a graph G and a spanning tree T of G, we say that T is a tree t-spanner of G if the distance between every pair of vertices in T is at most t times their distance in G. The p...