Morgan Stanley Technology, Media & Telecom Conference 2026 March 5, 2026 2:30 PM ESTCompany ParticipantsSpencer Rascoff - ...
Abstract: Give a finite undirected graph G = (V, E) and a positive integer κ ≥ 1, a distance-k matching is an edge set D ⊂ E that the pairwise distance of edges in D is at least k in G. The famous ...
Abstract: In recent years, edge computing has emerged as a promising solution for deploying IoT applications that demand minimal latency. By leveraging Function as a Service (FaaS) at the edge, it is ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results