Zobrazeno 1 - 10
of 26
pro vyhledávání: '"Grelier, Nicolas"'
Autor:
Grelier, Nicolas, Kaufmann, Stéphane
When doing a study on a large number of video games, it may be difficult to cluster them into coherent groups to better study them. In this paper, we introduce a novel algorithm, that takes as input any set of games S that are released on Steam and a
Externí odkaz:
http://arxiv.org/abs/2312.03411
Autor:
Grelier, Nicolas, Kaufmann, Stéphane
As a novel and fast-changing field, the video game industry does not have a fixed and well-defined vocabulary. In particular, game genres are of interest: No two experts seem to agree on what they are and how they relate to each other. We use the use
Externí odkaz:
http://arxiv.org/abs/2303.07179
A family of $k$ point sets in $d$ dimensions is well-separated if the convex hulls of any two disjoint subfamilies can be separated by a hyperplane. Well-separation is a strong assumption that allows us to conclude that certain kinds of generalized h
Externí odkaz:
http://arxiv.org/abs/2209.02319
Autor:
Cleve, Jonas, Grelier, Nicolas, Knorr, Kristin, Löffler, Maarten, Mulzer, Wolfgang, Perz, Daniel
Let $\mathcal{D}$ be a set of straight-line segments in the plane, potentially crossing, and let $c$ be a positive integer. We denote by $P$ the union of the endpoints of the straight-line segments of $\mathcal{D}$ and of the intersection points betw
Externí odkaz:
http://arxiv.org/abs/2209.02103
Autor:
Grelier, Nicolas
In the 90's Clark, Colbourn and Johnson wrote a seminal paper where they proved that maximum clique can be solved in polynomial time in unit disk graphs. Since then, the complexity of maximum clique in intersection graphs of d-dimensional (unit) ball
Externí odkaz:
http://arxiv.org/abs/2007.03492
We study the complexity of Maximum Clique in intersection graphs of convex objects in the plane. On the algorithmic side, we extend the polynomial-time algorithm for unit disks [Clark '90, Raghavan and Spinrad '03] to translates of any fixed convex s
Externí odkaz:
http://arxiv.org/abs/2003.02583
Autor:
Grelier, Nicolas
We consider the Minimum Convex Partition problem: Given a set P of n points in the plane, draw a plane graph G on P, with positive minimum degree, such that G partitions the convex hull of P into a minimum number of convex faces. We show that Minimum
Externí odkaz:
http://arxiv.org/abs/1911.07697
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, vol. 23, no. 3, Combinatorics (August 19, 2021) dmtcs:6631
A family S of convex sets in the plane defines a hypergraph H = (S, E) as follows. Every subfamily S' of S defines a hyperedge of H if and only if there exists a halfspace h that fully contains S' , and no other set of S is fully contained in h. In t
Externí odkaz:
http://arxiv.org/abs/1907.01241
Autor:
Pasdeloup, Bastien, Gripon, Vincent, Vialatte, Jean-Charles, Grelier, Nicolas, Pastor, Dominique
In this paper, we introduce translation operators on graphs. Contrary to spectrally-defined translations in the framework of graph signal processing, our operators mimic neighborhood-preserving properties of translation operators defined in Euclidean
Externí odkaz:
http://arxiv.org/abs/1709.03859
In many domains (e.g. Internet of Things, neuroimaging) signals are naturally supported on graphs. These graphs usually convey information on similarity between the values taken by the signal at the corresponding vertices. An interest of using graphs
Externí odkaz:
http://arxiv.org/abs/1606.02479