33 citations · 84 across the 22 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.DS2015★ 33 cited
Towards Tight Bounds for the Streaming Set Cover Problem
Sariel Har-Peled, Piotr Indyk, Sepideh Mahabadi +1
We consider the classic Set Cover problem in the data stream model. For elements and sets () we give a -pass algorithm with a strongly sub-linear $\tilde{O…
cs.DB2015★ 2 cited
Cost-Effective Conceptual Design Using Taxonomies
Ali Vakilian, Yodsawalai Chodpathumwan, Arash Termehchy +1
It is known that annotating named entities in unstructured and semi-structured data sets by their concepts improves the effectiveness of answering queries over these data sets. As…