We study the problem of creating highly compressed fulltext index structures for versioned document collections, that is, collections that contain multiple versions of each docume...
A nadir point is constructed by the worst objective values of the solutions of the entire Pareto-optimal set. Along with the ideal point, the nadir point provides the range of obje...
The construction of covering arrays with the fewest rows remains a challenging problem. Most computational and recursive constructions result in extensive repetition of coverage. W...
Peyman Nayeri, Charles J. Colbourn, Goran Konjevod
A weakly-supervised extraction method identifies concepts within conceptual hierarchies, at the appropriate level of specificity (e.g., Bank vs. Institution), to which attribute...
Modern computer systems are based on the traditional hierarchical file system model, but typically contain large numbers of files with complex interrelationships. This tradition...