Match Group, Inc. (MTCH) Presents at Morgan Stanley Technology, Media & Telecom Conference 2026 Transcript

Morgan Stanley Technology, Media & Telecom Conference 2026 March 5, 2026 2:30 PM ESTCompany ParticipantsSpencer Rascoff - ...
IEEE

Linear time algorithm for maximum distance-k matching in interval graphs

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 ...
Wall Street Journal

A Stanford Experiment to Pair 5,000 Singles Has Taken Over Campus

When Ben Rosenfeld started working as a residential assistant at a Stanford University dorm, he encountered 77 freshmen possessed by an “all-consuming” force. His new gig coincided with the release of ...
IEEE

An Anti-Occlusion Matching Algorithm of Multimodal Images Based on Graph Structure

Abstract: Occlusion is a common difficulty in application of multimodal image matching, which is essential for navigation and computer vision. However, recent multimodal image matching algorithms ...