The space of graphs is often characterized by a nontrivial geometry, which complicates learning and inference in practical applications. A common approach is to use embedding techniques to represent ...

Given a set of n points and a set of m unit disks on a 2-dimensional plane, the discrete unit disk cover (DUDC) problem is (i) to check whether each point in is covered by at least one disk in or not ...

Due to its non-Euclidean geometry, usual Euclidean learning algorithms may deliver poor performance on such data. We propose a principled reformulation of the successful Euclidean generalized learning ...

A history of non-Euclidean geometry : evolution of the concept of a geometric space by Rozenfelʹd, B. A. (Boris Abramovich) Publication date 1988 Topics Geometry, Non-Euclidean -- History Publisher ...

New Apple study challenges whether AI models truly “reason” through problems Puzzle-based experiments reveal limitations of simulated reasoning, but others dispute findings.