1871 search results - page 105 / 375 » The Ephemeral Pairing Problem |
STOC
1990
ACM
15 years 3 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...
LREC
2010
15 years 23 days 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...
SODA
2004
ACM
15 years 20 days 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...
111
click to vote
Publication
In this paper we address the problem of defining a measure of diversity for a population of individuals whose genome can be subjected to major reorganizations during the evolution...
107
click to vote
KDD
2006
ACM
15 years 11 months ago
2006
ACM
Previous efforts on event detection from the web have focused primarily on web content and structure data ignoring the rich collection of web log data. In this paper, we propose t...