Brent Lessley

Ph.D. Candidate
CIS Department
University of Oregon

Office:343 Deschutes
E-mail:blessley[at]cs[dot]uoregon[dot]edu

Bio

Brent is a Ph.D. Candidate in the Computer Science Department at the University of Oregon. He is currently exploring many-core, parallel solutions for graph and scientific visualization algorithms, including maximal clique enumeration, image segmentation, and external facelist calculation. He spent the summers of 2016 and 2017 at Lawrence Berkeley National Laboratory working with Dr. Wes Bethel.

Prior to joining the CDUX research group, Brent studied data mining and machine learning, with a particular focus on adversarial (robust) machine learning and spam detection. He received a B.A. in Business Administration (2009) and M.S. in Computer Science (2011), both from the University of Washington. Hobbies include singing, running, and learning languages.

Publications


Maximal Clique Enumeration with Data-Parallel Primitives
Brent Lessley, Talita Perciano, Manish Mathai, Hank Childs, and E. Wes Bethel
IEEE Symposium on Large Data Analysis and Visualization (LDAV), Phoenix, AZ, October 2017

[PDF]     [BIB]

Techniques for Data-Parallel Searching for Duplicate Elements
Brent Lessley, Kenneth Moreland, Matt Larsen, and Hank Childs
IEEE Symposium on Large Data Analysis and Visualization (LDAV), Phoenix, AZ, October 2017

[PDF]     [BIB]

External Facelist Calculation with Data-Parallel Primitives
Brent Lessley, Roba Binyahib, Rob Maynard, and Hank Childs
EuroGraphics Symposium on Parallel Graphics and Visualization (EGPGV), Groningen, The Netherlands, June 2016

[PDF]     [BIB]