المؤلفون: Barrière, Isabelle, Joseph, Blandine, Aharodnik, Katsiaryna, Kresh, Sarah, Fleurio, Guetjens Prince, Legendre, Géraldine, Nazzi, Thierry

المساهمون: CUNY Graduate Center (The Graduate Center), City University of New York New York (CUNY), Johns Hopkins University (JHU), Centre Neurosciences intégratives et Cognition / Integrative Neuroscience and Cognition Center (INCC - UMR 8002), Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité)

المصدر: ISSN: 0920-9034 ; Journal of Pidgin and Creole Languages ; https://hal.science/hal-04197080Test ; Journal of Pidgin and Creole Languages, In press, ⟨10.1075/jpcl.22001.bar⟩.

مصطلحات موضوعية: Haitian Creole, subject verb dependencies, pronouns, clitics, morphophonology, language acquisition, learnability, paradigm cell complexity, video-matching comprehension task, [SCCO.LING]Cognitive science/Linguistics

العلاقة: hal-04197080; https://hal.science/hal-04197080Test; https://hal.science/hal-04197080/documentTest; https://hal.science/hal-04197080/file/Barriere%20et%20al%20JPCL_2023_%20Haitian%20finalWORD.pdfTest

الإتاحة: https://doi.org/10.1075/jpcl.22001.barTest
https://hal.science/hal-04197080Test
https://hal.science/hal-04197080/documentTest
https://hal.science/hal-04197080/file/Barriere%20et%20al%20JPCL_2023_%20Haitian%20finalWORD.pdfTest

المؤلفون: Jonathan Naoum, Michel Lavoie, Marcelo Pedrosa Gomes, Philippe Juneau

المصدر: Stresses; Volume 3; Issue 1; Pages: 102-124

مصطلحات موضوعية: fomesafen, PPO-inhibitor, Reflex ®, chlorophytes, cyanophytes, growth, photosynthesis, Chl a, ROS, biovolume, cell complexity

وصف الملف: application/pdf

العلاقة: Plant and Photoautotrophic Stresses; https://dx.doi.org/10.3390/stresses3010009Test

الإتاحة: https://doi.org/10.3390/stresses3010009Test

المؤلفون: Chan, Timothy M., van Dijk, Thomas C., Fleszar, Krzysztof, Spoerhase, Joachim, Wolff, Alexander

المساهمون: Timothy M. Chan and Thomas C. van Dijk and Krzysztof Fleszar and Joachim Spoerhase and Alexander Wolff

مصطلحات موضوعية: Geometric optimization, NP-hard, approximation, shallow-cell complexity, line stabbing

وصف الملف: application/pdf

العلاقة: Is Part Of LIPIcs, Volume 123, 29th International Symposium on Algorithms and Computation (ISAAC 2018); urn:nbn:de:0030-drops-100094; https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.61Test

الإتاحة: https://doi.org/10.4230/LIPIcs.ISAAC.2018.61Test
https://nbn-resolving.org/urn:nbn:de:0030-drops-100094Test

المؤلفون: Dutta, Kunal, Ghosh, Arijit, Jartoux, Bruno, Mustafa, Nabil

المساهمون: Understanding the Shape of Data (DATASHAPE), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria), Indian Statistical Institute Kolkata, Laboratoire d'Informatique Gaspard-Monge (LIGM), École des Ponts ParisTech (ENPC)-Centre National de la Recherche Scientifique (CNRS)-Université Gustave Eiffel, ANR-14-CE25-0016,SAGA,Approximation geometrique structurelle pour l'algorithmique(2014), European Project: 339025,EC:FP7:ERC,ERC-2013-ADG,GUDHI(2014)

المصدر: 33rd International Symposium on Computational Geometry (SoCG 2017)
https://hal.science/hal-01360443Test
33rd International Symposium on Computational Geometry (SoCG 2017), Jul 2017, Brisbane, Australia. ⟨10.1007/s00454-019-00075-0⟩
https://link-springer-com.extranet.enpc.fr/article/10.1007/s00454-019-00075-0Test

مصطلحات موضوعية: lower bounds on shallow packings, polynomial partitioning, Shallow packing lemma, Epsilon-nets, shallow cell complexity, Mnets, Haussler's packing lemma, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG]

جغرافية الموضوع: Brisbane, Australia

العلاقة: info:eu-repo/grantAgreement/EC/FP7/339025/EU/Algorithmic Foundations of Geometry Understanding in Higher Dimensions/GUDHI; hal-01360443; https://hal.science/hal-01360443Test; https://hal.science/hal-01360443/documentTest; https://hal.science/hal-01360443/file/Journal%20version%20app-packing.pdfTest

الإتاحة: https://doi.org/10.1007/s00454-019-00075-0Test
https://hal.science/hal-01360443Test
https://hal.science/hal-01360443/documentTest
https://hal.science/hal-01360443/file/Journal%20version%20app-packing.pdfTest

المؤلفون: Kupavskii, Andrey, Mustafa, Nabil, Pach, János

المساهمون: Andrey Kupavskii and Nabil Mustafa and János Pach

مصطلحات موضوعية: epsilon-nets, lower bounds, geometric set systems, shallow-cell complexity, half-spaces

وصف الملف: application/pdf

العلاقة: Is Part Of LIPIcs, Volume 51, 32nd International Symposium on Computational Geometry (SoCG 2016); urn:nbn:de:0030-drops-59467; https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.54Test

الإتاحة: https://doi.org/10.4230/LIPIcs.SoCG.2016.54Test
https://nbn-resolving.org/urn:nbn:de:0030-drops-59467Test

المؤلفون: John Arlington Fuerst, Evgeny eSagulenko

المصدر: Frontiers in Microbiology, Vol 3 (2012)

مصطلحات موضوعية: evolution, compartmentalization, cell complexity, LUCA, eukaryote evolution, origin of nucleus, Microbiology, QR1-502

وصف الملف: electronic resource

العلاقة: http://journal.frontiersin.org/Journal/10.3389/fmicb.2012.00167/fullTest; https://doaj.org/toc/1664-302XTest

الوصول الحر: https://doaj.org/article/e813c5d1217e450680387b93ef0fd157Test

المؤلفون: John A. Fuerst, Evgeny Sagulenko, Jonathan H. Badger, J. Craig Venter, Peter J. Christie

المساهمون: The Pennsylvania State University CiteSeerX Archives

المصدر: ftp://ftp.ncbi.nlm.nih.gov/pub/pmc/ae/91/Front_Microbiol_2012_May_4_3_167.tar.gz

مصطلحات موضوعية: Planctomycetes, evolution, compartmentalization, cell complexity, LUCA, eukaryote evolution, origin of nucleus

وصف الملف: application/zip

العلاقة: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.270.6091Test

المؤلفون: Dutta, Kunal, Ghosh, Arijit, Jartoux, Bruno, Mustafa, Nabil

المساهمون: Understanding the Shape of Data (DATASHAPE), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria), Advanced Computing and Microelectronics Unit Kolkata (ACMU), Indian Statistical Institute Kolkata, Laboratoire d'Informatique Gaspard-Monge (LIGM), Université Paris-Est Marne-la-Vallée (UPEM)-École des Ponts ParisTech (ENPC)-ESIEE Paris-Fédération de Recherche Bézout (BEZOUT), Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS), ANR-14-CE25-0016,SAGA,Approximation geometrique structurelle pour l'algorithmique(2014)

المصدر: ISSN: 0179-5376.

مصطلحات موضوعية: Epsilon-nets, Haussler's Packing Lemma, Mnets, Shallow-cell complexity, Shallow Packing Lemma, [SCCO.COMP]Cognitive science/Computer science

العلاقة: hal-02316975; https://hal.science/hal-02316975Test

الإتاحة: https://doi.org/10.1007/s00454-019-00075-0Test
https://hal.science/hal-02316975Test

المؤلفون: Nabil H. Mustafa, Arijit Ghosh, Kunal Dutta, Bruno Jartoux

المساهمون: Understanding the Shape of Data (DATASHAPE), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria), Indian Statistical Institute [Kolkata], Laboratoire d'Informatique Gaspard-Monge (LIGM), Université Paris-Est Marne-la-Vallée (UPEM)-École des Ponts ParisTech (ENPC)-ESIEE Paris-Fédération de Recherche Bézout-Centre National de la Recherche Scientifique (CNRS), ANR-14-CE25-0016,SAGA,Approximation geometrique structurelle pour l'algorithmique(2014), European Project: 339025,EC:FP7:ERC,ERC-2013-ADG,GUDHI(2014), Advanced Computing and Microelectronics Unit [Kolkata] (ACMU), Centre National de la Recherche Scientifique (CNRS)-Fédération de Recherche Bézout-ESIEE Paris-École des Ponts ParisTech (ENPC)-Université Paris-Est Marne-la-Vallée (UPEM), Dutta, Kunal, Appel à projets générique - Approximation geometrique structurelle pour l'algorithmique - - SAGA2014 - ANR-14-CE25-0016 - Appel à projets générique - VALID, Algorithmic Foundations of Geometry Understanding in Higher Dimensions - GUDHI - - EC:FP7:ERC2014-02-01 - 2019-01-31 - 339025 - VALID

المصدر: 33rd International Symposium on Computational Geometry (SoCG 2017)
33rd International Symposium on Computational Geometry (SoCG 2017), Jul 2017, Brisbane, Australia
Discrete and Computational Geometry
Discrete and Computational Geometry, 2019, 61 (4), pp.756-777. ⟨10.1007/s00454-019-00075-0⟩
Discrete and Computational Geometry, Springer Verlag, 2019, 61 (4), pp.756-777. ⟨10.1007/s00454-019-00075-0⟩
33rd International Symposium on Computational Geometry
Leibniz International Proceedings in Informatics

مصطلحات موضوعية: Semialgebraic set, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], 050101 languages & linguistics, Mnets, lower bounds on shallow packings, [SCCO.COMP]Cognitive science/Computer science, 02 engineering and technology, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], Omega, Upper and lower bounds, Theoretical Computer Science, Combinatorics, [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], Shallow-cell complexity, polynomial partitioning, Haussler's packing lemma, 0202 electrical engineering, electronic engineering, information engineering, Discrete Mathematics and Combinatorics, 0501 psychology and cognitive sciences, Symmetric difference, Mathematics, Polynomial (hyperelastic model), 000 Computer science, knowledge, general works, Epsilon-nets, 05 social sciences, Function (mathematics), [INFO.INFO-LG] Computer Science [cs]/Machine Learning [cs.LG], Net (mathematics), [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Shallow packing lemma, Computational Theory and Mathematics, Computer Science, 020201 artificial intelligence & image processing, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], Geometry and Topology, shallow cell complexity

وصف الملف: application/pdf

الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::04f7001d4a365897c44406956a00dc71Test
https://hal.science/hal-01360443/documentTest

المؤلفون: Fuerst, John A., Sagulenko, Evgeny

مصطلحات موضوعية: Planctomycetes, Evolution, Compartmentalization, Cell complexity, 2404 Microbiology, 2726 Microbiology (medical)

العلاقة: orcid:0000-0002-6451-8533

الإتاحة: https://doi.org/10.3389/fmicb.2012.00167Test
https://espace.library.uq.edu.au/view/UQ:274172Test