Zobrazeno 1 - 10
of 74
pro vyhledávání: '"Antoine Vigneron"'
Publikováno v:
Symmetry, Vol 16, Iss 2, p 206 (2024)
Given a set of n disks in the plane, we study the problem of finding k lines that together intersect the maximum number of input disks. We consider three variants of this problem with the following constraints on the solution: (1) no constraint on th
Externí odkaz:
https://doaj.org/article/720262924f00483990eafc49a395cd98
Autor:
Héloïse Castiglione, Pierre-Antoine Vigneron, Camille Baquerre, Frank Yates, Jessica Rontard, Thibault Honegger
Publikováno v:
Pharmaceutics, Vol 14, Iss 11, p 2301 (2022)
There is an urgent need for predictive in vitro models to improve disease modeling and drug target identification and validation, especially for neurological disorders. Cerebral organoids, as alternative methods to in vivo studies, appear now as powe
Externí odkaz:
https://doaj.org/article/8bde374b2a47425dbe2a07653ff7b0a1
Autor:
Hyeyun Yang, Antoine Vigneron
Publikováno v:
ACM Journal of Experimental Algorithmics. 27:1-14
The third computational geometry challenge was on a coordinated path planning problem in which a collection of square robots need to move on the integer grid, from their given starting points to their target points, and without collision between robo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::218f570dbbf2972318875f4359e05361
https://doi.org/10.1145/3531224
https://doi.org/10.1145/3531224
Autor:
Adam T Brockett, Gary A Kane, Patrick K Monari, Brandy A Briones, Pierre-Antoine Vigneron, Gabriela A Barber, Andres Bermudez, Uma Dieffenbach, Alexander D Kloth, Timothy J Buschman, Elizabeth Gould
Publikováno v:
PLoS ONE, Vol 13, Iss 4, p e0195726 (2018)
The medial prefrontal cortex (mPFC) is important for cognitive flexibility, the ability to switch between two task-relevant dimensions. Changes in neuronal oscillations and alterations in the coupling across frequency ranges have been correlated with
Externí odkaz:
https://doaj.org/article/36739b6b2573408898bbb3745298e118
Autor:
Antoine Vigneron, Hyeyun Yang
Publikováno v:
Theoretical Computer Science. 866:82-95
We give approximation algorithms for matching two sets of line segments in constant dimension. We consider several versions of the problem: Hausdorff distance, bottleneck distance and largest common subset. We study these similarity measures under se
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8542aa223978c74135c92f92a3ec8bff
https://doi.org/10.1016/j.tcs.2021.03.014
https://doi.org/10.1016/j.tcs.2021.03.014
Autor:
Aditya Bhaskara, Antoine Vigneron
Publikováno v:
Information Processing Letters. 149:10-13
We show how to construct a set S of O ( 1 / e 1.5 ) points such that for any convex set C contained in the unit square, the convex hull of the points in S that are contained in C has area at least | C | − e . We present two algorithmic applications
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::896dfda46c1d7bea34ad2d26d94ca2a0
https://doi.org/10.1016/j.ipl.2019.05.002
https://doi.org/10.1016/j.ipl.2019.05.002
Publikováno v:
Computational Geometry. 80:40-52
We establish tight bounds for beacon-based coverage problems. In particular, we show that ⌊ n 6 ⌋ beacons are always sufficient and sometimes necessary to cover a simple rectilinear polygon P with n vertices. When P is monotone and rectilinear, w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a60c6f39ef9a66995c9a999997bbb323
https://doi.org/10.1016/j.comgeo.2019.02.002
https://doi.org/10.1016/j.comgeo.2019.02.002
Publikováno v:
Digital.CSIC. Repositorio Institucional del CSIC
instname
instname
Brain energy metabolism is often considered as a succession of biochemical steps that metabolize the fuel (glucose and oxygen) for the unique purpose of providing sufficient ATP to maintain the huge information processing power of the brain. However,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e01a012aba95ee6635b9aadcd484dd60
http://hdl.handle.net/10261/221068
http://hdl.handle.net/10261/221068
Publikováno v:
International Journal of Computational Geometry & Applications. 27:177-185
Let [Formula: see text] and [Formula: see text] be two discrete point sets in [Formula: see text] of sizes [Formula: see text] and [Formula: see text], respectively, and let [Formula: see text] be a given input threshold. The largest common point set
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a502becb47e6572e10fd8410fbbfbaa2
https://doi.org/10.1142/s0218195917500029
https://doi.org/10.1142/s0218195917500029
Publikováno v:
International Journal of Computational Geometry & Applications. 27:13-32
We propose an algorithm for finding a [Formula: see text]-approximate shortest path through a weighted 3D simplicial complex [Formula: see text]. The weights are integers from the range [Formula: see text] and the vertices have integral coordinates.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4f66a5daacdc2e5a4b3c946d1bf79b26
https://doi.org/10.1142/s0218195917600020
https://doi.org/10.1142/s0218195917600020