Home
Topics
Computational Theory, Algorithms and Mathematics

Computational Theory, Algorithms and Mathematics

Available Speakers and their Lectures on this Topic

Mehdi Bahrami – Santa Clara, CA, United States

Advancing AGI: From Training and Fine-Tuning to Interactive Agent Development
This talk begins by tracing the history of Artificial General Intelligence (AGI) and discusses potential advancements and future directions. AGI can enhance not only the capability of...

Nelly Bencomo – Durham, United Kingdom

Decision-Making under Uncertainty: Human-Machine Teaming
There is growing uncertainty about the environment of software systems. Therefore, how the system should behave under different contexts cannot be fully predicted at design time. It is...

Yuejie Chi – Pittsburgh, PA, United States

A Tale of Preconditioning and Overparameterization in Ill-conditioned Low-rank Estimation
Many problems encountered in science and engineering can be formulated as estimating a low-rank object from incomplete, and possibly corrupted, linear measurements. Through the lens of matrix and...
From Single-agent to Federated Reinforcement Learning
Reinforcement learning (RL) is garnering significant interest in recent years due to its success in a wide variety of modern applications. Q-learning, which seeks to learn the optimal Q-function...
Provable Learning from Data with Priors: from Low-rank to Diffusion Models
Generative priors are effective tools to combat the curse of dimensionality, and enable efficient learning that otherwise will be ill-posed, in data science. This talk starts with the classical...
Statistical Foundations of Reinforcement Learning Through a Non-asymptotic Lens
Reinforcement learning (RL) is garnering significant interest in recent years due to its success in a wide variety of modern applications. However, theoretical understandings on the...

Kalyanmoy Deb – MI, United States

Machine Learning Assisted Improvements to Multi-Criterion Optimization Algorithms
Multi-criterion optimization problems give rise to a set of Pareto-optimal solutions, which first must be found before a single preferred solution is chosen for implementation. To find a...
Problem Solving with Multiple Criteria ? A New and Innovative Tool in Computing
Most practical search and optimization related problem-solving tasks involve multiple conflicting criteria, which all must be considered simultaneously during an optimization algorithm. A...
Recent Advancements in Evolutionary Multi-Criterion Optimization and Decision-making
Evolutionary multi-criterion optimization (EMO) research is now more than three decades old. Efficient algorithms and demonstrative applications have encouraged researchers...

Dan Garcia – Millbrae, CA, United States

The Beauty and Joy of Binary Numbers
(This is meant for the general public, especially young children)

In this interactive demonstration, we explain binary numbers, the foundation of electrical engineering and...

Angel Goñi-Moreno – Madrid, Spain

Cellular Computing: From Inspiration to Implementation
This lecture provides a historical overview of cellular computing, highlighting its profound intersection with computer science and biology over the decades. It explores how biology has...
Engineering Boolean Logic Circuits with Living Matter
Within a living cell, a gene can either be expressed or not, akin to the digital on-off signalling familiar in electronic engineering. While there are of course numerous differences, this...
Toward Next-Generation Biocomputing: The Need for Computer Scientists!
This lecture explores the vital roles computer scientists can play in advancing biocomputing. From conducting computational simulations and developing theoretical frameworks to creating software...

Minming Li – Hong Kong, Hong Kong

Defending with Shared Resources on a Network
In this talk we consider a defending problem on a network. In the model, the defender holds a total defending resource of R, which can be distributed to the nodes of the network. The defending...
Facility Location Games, from Origin to Recent Development
Mechanism Design, as one of the important areas in algorithmic game theory, can be classified into two categories: with money and without money. Facility location game is one of the mostly studied...
Facility Location Games, from Origin to Recent Development
: Mechanism Design, as one of the important areas in algorithmic game theory, can be classified into two categories: with money and without money. Facility location game is one of the mostly...

Gonzalo Navarro – Santiago, Chile

Compact Data Structures

The sharp growth in the amount of data applications are handling, plus the increasing gap in the memory hierarchy, gives rise to several approaches to efficiently handling large...
Compact Data Structures meet Databases
We describe two success stories on the application of compact data structures (cds) to solve the problem of the excessively redundant space requirements posed by...
On the Compressibility of Highly Repetitive Sequences
Compressed indexes for highly repetitive text collections can reduce the data size by orders of magnitude while still supporting efficient searches. Compression of this...

M. Sohel Rahman – Dhaka, Bangladesh

String Inference and (non)Lexicographic Ordering
In this lecture we will discuss two interesting but possibly less studied topics from string combinatorics. We will divide the talk into two parts. In the first part, we will briefly present...

Md. Saidur Rahman – Dhaka, Bangladesh

Design of Enumeration Algorithms: A Tool to Assist 4IR
You are going to buy a new apartment where you are allowed to choose a floorplan of the apartment. The development company has an AI expert system which shows you a floorplan. If you do not...
Drawing Planar Graphs
A graph is planar if it can be drawn or embedded in the plane so that no two edges intersect geometrically except at a vertex to which they are both incident. A plane graph is a planar...
Generating Scale-Free Networks with Graph Theoretic Properties
Generating synthetic networks with special properties is an important topic of research in network science. Generating algorithms enable researchers to replicate complex network structures,...
Graph Drawing Algorithms in VLSI Design Automation
A graph consists of a set of vertices and a set of edges, each joining two vertices. A drawing of a graph can be thought of as a diagram consisting of a collection of objects corresponding...
On Connectivity and Realizability of Triangle Cover Contact Graphs
Let S = {p1, p2, . . . , pn} be a set of pairwise disjoint geometric objects of some type in a 2D plane and let C = {c1, c2, . . . , cn} be a set of closed objects of some type in the same plane...
Relating Planar Graph Drawings to Planar Satisfiability Problems
A graph G=(V, E) consists of a set of vertices V and a set of edges E, where every edge e ∈ E makes a relationship between two vertices. Graph theory has numerous applications in computer...
Research on Pairwise Compatibility Graphs: Current State and Open Problems
Let T be an edge weighted tree and dmin, dmax be two non-negative real numbers where dmin ≤ dmax. The pairwise compatibility graph (PCG) of T for dmin, dmax is a graph G such that each vertex...

Salvador Elias Venegas-Andraca – Mexico City, Mexico

Quantum computing: from the lab to the market
The goal of this lecture is to provide a concise introduction to several scientific, technological, and commercial aspects of quantum computing. This talk can be tailored to suit the...

Feng Xia – Melbourne, VIC, Australia

Network Science Meets Data Science: Opportunities and Challenges
There is an emerging trend of the convergence of network science and data science, though neither of them is new. During the past decade, we have witnessed the exponential growth of data in almost...