82 search results - page 17 / 17 » On generalized separating hash families |
SIGIR
2006
ACM
14 years 11 days ago
2006
ACM
We present a new family of hybrid index maintenance strategies to be used in on-line index construction for monotonically growing text collections. These new strategies improve up...
SODA
2003
ACM
13 years 7 months ago
2003
ACM
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...