A probabilistically checkable proof (PCP) is a proof which can be verified by inspecting a small (usually constant) number of symbols from the proof. Informally, we say a PCP is zero-knowledge if no polynomial time algorithm with oracle access to the proof can learn anything more than the validity of the proof.
-
14May
-
15May
The emergence of ML-enabled technology platforms that aim to enhance molecule performance have the potential to revolutionize the way we approach drug discovery. However, without a purpose-built tech stack that puts data quality at the heart, many are destined to fail.
-
16May
The rapid adoption of Internet of Things (IoT) and Operational Technology (OT) devices to control systems remotely has introduced significant cyber-security challenges. Attackers have compromised millions of such devices over the years, exploiting their lack of management and weak cyber-security.
-
16May
I will report on the way I use Lean to teach first year math undergrads in Orsay. The main unusual thing is the use of a controlled natural language input syntax designed to make it easier to transfer proving skills from the computer to paper.
-
17May
Abstract not available
-
17May
Abstract not available
-
21May
*ABSTRACT*: Audio, as a novel digital phenotype (e.g., the body sound), has been studied and demonstrated to be effective via the power of computer audition (CA), an emerging technology that enables the computers to listen to the real world similar to or even beyond the human ear capacity.
-
23May
This presentation will explore advancements in genomic research, starting with de novo assembly, where Šikić's lab leads with novel applications of long reads technology.
-
23May
Abstract not available
-
24May
The emerging machine learning (ML) applications put exploding demands on hardware systems, and it is important to deliver high throughput, low latency and low energy consumption, in order to sustain the thriving development of cognitive systems and applications.