Improved Bounds for Coloring Locally Sparse Hypergraphs.

Fotis Iliopoulos

Published in: APPROX-RANDOM (2021)

Keyphrases

lower bound
upper bound
data sets
graph theory
information retrieval
support vector
high dimensional
tight bounds
database
theoretical guarantees
compressed sensing
sparse data
upper and lower bounds
sparse representation
least squares
probabilistic model
active learning
similarity measure
information systems