Event Archive

Sensor Arrays and Multi-Channel Systems: Adaptive Algorithms, Analysis, and Bounds

Duke Electrical Computer Engineering Colloquium
Speaker Name
Christ Richmond
Location
Talk will be virtual on Zoom
Date and Time
-

Sensor arrays and multi-channel systems play a central role in the activities of everyday society.  Cell phones, tablets, and laptops are now commonly fitted with numerous sensors; and many commercial and defense systems such as communication base stations, satellites, airborne surveillance radars, and sea bottom-mounted passive sonars all use various types of sensors arrays.

Customizing ML Algorithms for Online Algorithms

Algorithms Seminar
Speaker Name
Keerti Anand
Location
Talk will be virtual on Zoom
Date and Time
-

In this talk we focus on ML aided Online Algorithms. Traditionally, online algorithms assume a pessimistic viewpoint i.e. worst-case scenario for the future. A popular line of recent research incorporates ML advice in the design of online algorithms to improve their performance. However, these works treat the Machine Learning paradigm as a black-box, and redesign online algorithms to take advantage of such predictions.

On the Optimality of Optimistic Responsiveness

Duke Privacy and Security Seminar
Speaker Name
Nibesh Shrestha
Location
Talk will be virtual on Zoom
Date and Time
-

Synchronous consensus protocols, by definition, have a worst-case commit latency that depends on the bounded network delay. The notion of optimistic responsiveness was recently introduced to allow synchronous protocols to commit instantaneously when some optimistic conditions are met. In this work, we revisit this notion of optimistic responsiveness and present optimal latency results.

TechConnect Fall 2020

inDuke Event
Location
CareerEco virtual networking environment - Registration Required
Date and Time
-

Duke TechConnect brings students and employers together for networking, education and connections. At TechConnect for fall 2020, employers will connect with Engineering and Computer Science students in a virtual networking environment powered by CareerEco.

Improved Prophet Inequalities for Combinatorial Welfare Maximization with (Approximately) Subadditive Agents

Algorithms Seminar
Speaker Name
Hanrui Zhang
Location
Talk will be virtual on Zoom
Date and Time
-

We study a stochastic optimization problem called prophet inequalities, where a principal allocates items to agents arriving online, given only statistical knowledge about how much each agent values the items.  We give a framework for designing prophet inequalities for combinatorial welfare maximization.

The Formula Complexity of Multiplying k Permutations

Algorithms Seminar
Speaker Name
Benjamin Rossman
Location
Talk will be virtual on Zoom
Date and Time
-

Let P(k,n) denote the problem of computing the product of k n-by-n permutation matrices.  This problem is complete for complexity classes NC^1 when n = O(1) (Barrington’s Theorem) and Logspace when k = n.  A super-polynomial lower bound on the *formula complexity* of P(k,n) would separate NC^1 and Logspace (one of the major questions in theoretical computer science).  In this talk, I will discuss some recent results:

Minimal Spanning Acycles and Giant Shadows

Algorithms Seminar
Speaker Name
Sayan Mukherjee
Location
Talk will be virtual on Zoom
Date and Time
-
I will state some results on minimal spanning acycles (MSA) for a variant of the Linial-Meshulam model. I will discuss distributional properties of the weights included in the MSA, both in the bulk and in the extremes. Time permitting I will discuss an on-line minimal spanning tree algorithm that these results characterize.

Deterministic Min-cut in Poly-logarithmic Max-flows

Algorithms Seminar
Speaker Name
Debmalya Panigrahi
Location
Talk will be virtual on Zoom
Date and Time
-

The min-cut problem in undirected graphs asks for a minimum (weight) subset of edges whose removal disconnects the graph. In the 1990s, Karger developed several randomized (Monte Carlo) algorithms for this problem, leading to an eventual running time bound of \tilde{O}(m). At the time, the best deterministic algorithms for the problem, from the early 1990s, were much slower and ran in \tilde{O}(mn) time. This led him to ask whether the min-cut problem can be solved in \tilde{O}(m) time deterministically as well.

Amplifying Resources for Inclusiveness in Computing: Join CMD-IT for Standing Against Racial Injustices

Special Event
Location
Virtual - Zoom: Registration Required
Date and Time
-

Join Duke CS Professor of the Practice Nicki Washington and other panelists for this Center for Minorities and People with Disabilities in IT (CMD-IT) discussion from 2:30-3:30 pm EDT on Friday, August 7. Panelists will examine racial injustice from the perspective of Black professionals in computing, sharing their stories about overcoming racial injustices to get to where they are today. They will also share advice and insights about systemic changes needed for equity and inclusion.

Data+, Code+ and CS+ Summer 2020 Expo #3 of 3

Special Event
Location
Virtual - Zoom: Registration Required
Date and Time
-

Join us for an online expo to celebrate the results of over 180 talented Duke students who participated on projects in ccomputer science, big data, mobile app and web development this summer through summer projects in Computer Science, Data+, and Code+. Learn more about this event.

Registration Required:
Register Now

Data+, Code+ and CS+ Summer 2020 Expo #2 of 3

Special Event
Location
Virtual - Zoom: Registration Required
Date and Time
-

Join us for an online expo to celebrate the results of over 180 talented Duke students who participated on projects in ccomputer science, big data, mobile app and web development this summer through summer projects in Computer Science, Data+, and Code+. Learn more about this event.

Registration Required:
Register Now

Data+, Code+ and CS+ Summer 2020 Expo #1 of 3

Special Event
Location
Virtual - Zoom: Registration Required
Date and Time
-

Join us for an online expo to celebrate the results of over 180 talented Duke students who participated on projects in ccomputer science, big data, mobile app and web development this summer through summer projects in Computer Science, Data+, and Code+. Learn more about this event.

Registration Required:
Register Now

Algorithms for Two-sided Online Marketplaces

Ph. D. Defense
Speaker Name
Reza Alijani
Location
On Zoom
Date and Time
-

The recent emergence of new successful two-sided online platforms has transformed the concept of a marketplace. Numerous two-sided mechanism design problems are motivated by these platforms. There are unique features to a two-sided market, such as supply uncertainty and the need for ensuring budget balance, that make these problems particularly challenging. In this talk, we design models to capture the two-sidedness, identify the challenges, and use algorithmic techniques to solve these problems.

Two Algorithmic Schemes for Geometric Bipartite Matching and Transportation

Ph. D. Defense
Speaker Name
Allen Xiao
Location
On Zoom
Date and Time
-

Given n red points and n blue points in d-dimensional space and a
distance function, the geometric bipartite matching problem is to find a
matching of red points to blue points, such that the sum of distances
between the matched pairs is minimized. The general graph problem,
minimum cost bipartite matching, can be solved in polynomial time using
the classical Hungarian algorithm, which leads to a cubic algorithm for
the geometric matching problem. We present several algorithms for

Efficient Algorithms for Querying Large and Uncertain Data

Ph. D. Defense
Speaker Name
Stavros Sintos
Location
On Zoom
Date and Time
-

Query processing is an important problem in many research fields including database systems, data mining, and geometric computing. The goal is to preprocess input data into an index to efficiently answer queries. With the data sets becoming increasingly large and complex, queries are also becoming complex, therefore new challenging problems have emerged in the area of query processing. This talk focuses on two broad themes: data uncertainty and data summarization.

How to Create and Use Formative Assessments at Scale

Special Talk
Speaker Name
Kristin Stephens-Martinez
Location
Virtual - Zoom: Registration Required
Date and Time
-

Learn from Dr. Kristin Stephens-Martinez how to:

  • Design formative assessments

  • Understand a wide variety of questions types

  • Introduce formative assessments into your class

Dr. Stephens-Martinez will also share an example of her own process for designing formative assessments and how she uses it in her introductory computer science course.

Interpretability vs. Explainability in Machine Learning

Special Talk
Speaker Name
Cynthia Rudin, PhD
Location
Virtual - Zoom: Registration Required
Date and Time
-
  • With widespread use of machine learning, there have been serious societal consequences from using black box models for high-stakes decisions, including flawed bail and parole decisions in criminal justice. Explanations for black box models are not reliable, and can be misleading.

Durability Queries on Temporal Data

Ph. D. Defense
Speaker Name
Junyang Gao
Location
Talk will be virtual on Zoom
Date and Time
-

Temporal data is ubiquitous in our everyday life, but tends to be noisy and often exhibits transient patterns. To make better decisions with data, we must avoid jumping to conclusions based on certain particular query results or observations. Instead, a useful perspective is to consider "durability'', or, intuitively speaking, finding results that are robust and stand "the test of time''. This thesis studies durability queries on temporal data that return durable results efficiently and effectively.

Guaranteed Dashboard Mechanisms

CS-ECON Seminar Series
Speaker Name
Yuan Deng
Location
Talk will be virtual on Zoom
Date and Time
-

The taxation principle guarantees that any single-agent mechanism can be interpreted as a menu-based mechanism (one that offers each buyer a menu: a mapping from their payment to their (expected) allocation) without loss of generality. What loss in welfare does one incur in designing multiagent menu-based mechanisms in prior-free environments? We study this question for general single-dimensional valuations and give tight characterizations of the loss in welfare as a function of natural parameters governing the evolution of value profile across rounds.