Chengdu A — Entidade

tcsuestc.com·há cerca de 1 mês

Saket Saurabh: Picking Random At Vertices

Abstract: We survey some recent graph algorithms that are based on picking a vertex at random and declaring it to be a part of the solution. This simple idea has been deployed to obtain state-of-the-a

tcsuestc.com·há 3 meses

Jie Xue: Fine-Grained Bounds for Courcelle’s Theorem

Speaker: Jie Xue(New York University Shanghai) Time: 16:20-17:20 Beijing Time June 4, 2026 (Thursday) Venue: 四号科研楼A区 518 Abstract: Courcelle’s theorem is one of the most celebrated algorithmic m

tcsuestc.com·há 3 meses

Wenfei Fan: Beyond LLMs: A Multi-Paradigm AI Approach

Speaker: 樊文飞 (Shenzhen Institute of Computing Sciences) Time: 10:00-11:30 Beijing Time May 14, 2026 (Thursday) Venue: 四号科研楼A区 518 Abstract: Large Language Models (LLMs) are transforming many applicati