( en | de | ru )

 

Disambiguation of "Rao, Satish"

Author of the publication

copydeleteadd this publication to your clipboard
Near-Optimal Evasion of Convex-Inducing Classifiers.

, , , , , , , , and . AISTATS, volume 9 of JMLR Proceedings, page 549-556. JMLR.org, (2010)

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.

Satish Mishra

Satish Koria

Satish Sule

Satish Khurana

Satish Wakchaure

 

Other publications of authors with the same name

Fast phylogeny reconstruction through learning of ancestral sequences, , and . CoRR, (2008)Distributed algorithms for multicommodity flow problems via approximate steepest descent framework., , and . ACM Trans. Algorithms, 9 (1): 3:1-3:14 (2012)Eigenvalue bounds, spectral partitioning, and metrical deformations via flows., , and . J. ACM, 57 (3): 13:1-13:23 (2010)Using Max Cut to Enhance Rooted Trees Consistency., and . IEEE ACM Trans. Comput. Biol. Bioinform., 3 (4): 323-333 (2006)A tight bound on approximating arbitrary metrics by tree metrics., , and . J. Comput. Syst. Sci., 69 (3): 485-497 (2004)Stealthy poisoning attacks on PCA-based anomaly detectors., , , , , , , and . SIGMETRICS Perform. Evaluation Rev., 37 (2): 73-74 (2009)l22 spreading metrics for vertex ordering problems., , , and . SODA, page 1018-1027. ACM Press, (2006)Fast Phylogeny Reconstruction Through Learning of Ancestral Sequences., , and . Algorithmica, 66 (2): 419-449 (2013)An Approximate Max-Flow Min-Cut Relation for Unidirected Multicommodity Flow, with Applications., , , and . Combinatorica, 15 (2): 187-202 (1995)A Flow-Based Method for Improving the Expansion or Conductance of Graph Cuts., and . IPCO, volume 3064 of Lecture Notes in Computer Science, page 325-337. Springer, (2004)