Author of the publication

An Approximation Algorithm for the Noah's Ark Problem with Random Feature Loss.

, , , , and . IEEE ACM Trans. Comput. Biol. Bioinform., 8 (2): 551-556 (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Short Text Stream Clustering via Frequent Word Pairs and Reassignment of Outliers to Clusters., , and . DocEng, page 13:1-13:4. ACM, (2020)Cache-Oblivious Planar Shortest Paths., and . ICALP, volume 3580 of Lecture Notes in Computer Science, page 563-575. Springer, (2005)Graph Convolutional Networks for Categorizing Online Harassment on Twitter., , and . ICMLA, page 946-951. IEEE, (2021)A faster cache-oblivious shortest-path algorithm for undirected graphs with bounded edge lengths., , and . SODA, page 910-919. SIAM, (2007)Low-interference networks in metric spaces of bounded doubling dimension., , and . Inf. Process. Lett., 111 (23-24): 1120-1123 (2011)Graph Representation Learning in Document Wikification., , and . ICDAR Workshops (2), volume 12917 of Lecture Notes in Computer Science, page 509-524. Springer, (2021)Another virtue of wavelet forests., , , , and . DCC, page 559. IEEE, (2024)NAPX: A Polynomial Time Approximation Scheme for the Noah's Ark Problem., , , and . WABI, volume 5251 of Lecture Notes in Computer Science, page 76-86. Springer, (2008)Relaxed Gabriel Graphs., , , , , , and . CCCG, page 169-172. (2009)On Finding Minimum Deadly Sets for Directed Networks., and . SIROCCO, volume 8 of Proceedings in Informatics, page 351-366. Carleton Scientific, (2001)