CS Events
Computer Science Department ColloquiumMajority Rule, Visibility Graphs, External Memory Algorithms, and Graph Cities |
|
||
Tuesday, December 19, 2023, 10:30am - 12:00pm |
|||
Speaker: James Abello
Bio
James Abello is an Associate Professor of Practice in the Department of Computer Science at Rutgers University. He received his PhD in Combinatorial Algorithms from the University of California San Diego and was awarded a University of California President’s Postdoctoral Fellowship (1985-1987). James has been a senior member of technical staff at AT&T Shannon Laboratories, Bell Labs, Senior Scientist at Ask.com, and a DIMACS Research Professor. He was the Director of the MS program in the Computer Science Department from 2016 to 2022.
James is the co-editor of External Memory Algorithms, Vol. 50 of the AMS-DIMACS Series (with Jeff Vitter. 1999), The Kluwer Handbook of Massive Data Sets (with P. Pardalos and M. Resende, 2002) and Discrete Methods in Epidemiology (with Graham Cormode, 2006).
James is broadly interested in algorithmic artifacts that facilitate processing, visualization, and data interactions, with the overall goal of making sense of massive amounts of information.
Location : CoRE 301
:
Event Type: Computer Science Department Colloquium
Abstract: We will highlight connections between the Majority Rule of Social Choice and Visibility Graphs of Polygons via the Symmetric Group; External Memory Algorithms and visualizations of over billion edge graphs called "Graph Cities", and the use of Graph Edge Partitions to extract semantic digests from social media.*The talk will be "almost" self-contained.
:
Contact Professor Ulrich Kremer