Ohad Shamir, Sivan Sabato, et al.
Theoretical Computer Science
Paper
Complexity of finding k-path-free dominating sets in graphs
Related
Victor Valls, Panagiotis Promponas, et al.
IEEE Communications Magazine
Conference paper
Compression for data archiving and backup revisited
Corneliu Constantinescu
SPIE Optical Engineering + Applications 2009
Conference paper
Low-Resource Speech Recognition of 500-Word Vocabularies
Sabine Deligne, Ellen Eide, et al.
INTERSPEECH - Eurospeech 2001