BEN RUBINSTEIN

PUBLICATIONS

Sort by:	[year] [type] [topic]
Jump to:	[Journal Papers] [Conference Papers] [Technical Reports] [Edited Volumes] [Unrefereed Papers] [Manuscripts]

REFEREED JOURNAL PAPERS

[2]		Benjamin I. P. Rubinstein, Peter L. Bartlett and J. Hyam Rubinstein. Shifting: One-Inclusion Mistake Bounds and Sample Compression, invited paper in the Special Issue on Learning Theory 2006 in the Journal of Computer and System Sciences, in press, 2008.
[1]		Benjamin I. P. Rubinstein, Jon McAuliffe, Simon Cawley, Marimuthu Palaniswami, Kotagiri Ramamohanarao and Terence P. Speed. Machine Learning in Low-level Microarray Analysis, position paper in ACM SIGKDD Explorations (Special Issue on Microarray Data Mining), 5(2), pp. 130-139, December 2003.

REFEREED CONFERENCE PAPERS

[6]		Marco Barreno, Peter L. Bartlett, Fuching Jack Chi, Anthony D. Joseph, Blaine Nelson, Benjamin I. P. Rubinstein and J. D. Tygar. Open Problems in the Security of Learning, accepted in to The First ACM Workshop on AISec, 2008.
[5]		Benjamin I. P. Rubinstein, Blaine Nelson, Ling Huang, Anthony D. Joseph, Shing-hon Lau, Nina Taft and J. D. Tygar. Evading Anomaly Detection through Variance Injection Attacks on PCA (Extended Abstract), in the 11th International Symposium on Recent Advances in Intrusion Detection (RAID 2008), pp. 394-395, 2008. Winner of the RAID08 Best Poster Award.
[4]		Benjamin I. P. Rubinstein and J. Hyam Rubinstein. Geometric & Topological Representations of Maximum Classes with Applications to Sample Compression, in the 21st Annual Conference on Learning Theory (COLT'08), pp. 299-310, 2008.
[3]		Blaine Nelson, Marco Barreno, Fuching Jack Chi, Anthony D. Joseph, Benjamin I. P. Rubinstein, Udam Saini, Charles Sutton, J. D. Tygar and Kai Xia. Exploiting Machine Learning to Subvert Your Spam Filter, in the First USENIX Workshop on Large-scale Exploits and Emergent Threats (LEET'08), 2008.
[2]		Benjamin I. P. Rubinstein, Peter L. Bartlett and J. Hyam Rubinstein. Shifting, One-Inclusion Mistake Bounds and Tight Multiclass Expected Risk Bounds, in Advances in Neural Information Processing Systems 19, pp. 1193-1200, 2007.
[1]		Benjamin I. P. Rubinstein. Evolving Quantum Circuits using Genetic Programming, in Proceedings of the 2001 IEEE Congress on Evolutionary Computation (CEC2001), IEEE Press, pp. 114-121, 2001. Winner of the IEEE Computer Society's Lance Stafford Larson Scholarship 2002 for Best Undergraduate Computer Science Paper (World-wide).

TECHNICAL REPORTS

[2]		Benjamin I. P. Rubinstein, Blaine Nelson, Ling Huang, Anthony D. Joseph, Shing-hon Lau, Nina Taft and Doug Tygar. Compromising PCA-based Anomaly Detectors for Network-Wide Traffic, EECS Department, University of California, Berkeley, Technical Report No. UCB/EECS-2008-73, May 29, 2008.
[1]		Benjamin I. P. Rubinstein, Peter L. Bartlett and J. Hyam Rubinstein. Shifting: One-Inclusion Mistake Bounds and Sample Compression, EECS Department, University of California, Berkeley, Technical Report No. UCB/EECS-2007-86, June 25, 2007.

EDITED VOLUMES

[2]		Gad Abraham and Benjamin I. P. Rubinstein (eds). Proceedings of the Second Australian Undergraduate Students' Computing Conference, AUSCC, Australia, ISBN 0-9757173-0-8, 175 pages, December 2004.
[1]		Benjamin I. P. Rubinstein, Nelson Chan, and Kalyanaraman K. Kshetrapalapuram (eds). Proceedings of the First Australian Undergraduate Students' Computing Conference, AUSCC, Australia, ISBN 0-646-42751-2, 126 pages, September 2003.

UNREFEREED PAPERS

[1]

Benjamin I. P. Rubinstein. Evolving Quantum Circuits using Genetic Programming, in Genetic Algorithms and Genetic Programming at Stanford 2000, edited by John R. Koza, pp. 325-334, Stanford Bookstore, Stanford University, CA, 2000.

MANUSCRIPTS SUBMITTED/IN PREPARATION

[1]

Benjamin I. P. Rubinstein, Blaine Nelson, Ling Huang, Anthony D. Joseph, Shing-hon Lau, Nina Taft and J. D. Tygar. Compromising PCA-based Anomaly Detectors for Network-Wide Traffic, conference paper submitted, 2008.

Maintained by:	Ben Rubinstein
Last updated:	Thu Sep 18 10:20:29 PDT 2008