- home
- Search
- EDIH Adria
- 2018-2022
- Publications
- Part of book or chapter of book
- FR
- GB
- US
- Mémoires en Sciences de l'Informati...
- Hyper Article en Ligne
- EDIH Adria
- 2018-2022
- Publications
- Part of book or chapter of book
- FR
- GB
- US
- Mémoires en Sciences de l'Informati...
- Hyper Article en Ligne
Loading
description Publicationkeyboard_double_arrow_right Conference object , Part of book or chapter of book , Other literature type 2018 FrancePublisher:Springer International Publishing Authors: Czerpowicka, Monika; Savary, Agata;Czerpowicka, Monika; Savary, Agata;International audience; We present SEJF, a lexical resource of Polish nominal, adjectival and adverbial multi-word expressions. It consists of an intensional module with about 4,700 multi-word lemmas assigned to 160 inflection graphs, and an extensional module with 88,000 automatically generated inflected forms annotated with grammatical tags. We show the results of its coverage evaluation against an annotated corpus. The resource is freely available under the Creative Commons BY-SA license.
Hyper Article en Lig... arrow_drop_down https://doi.org/10.1007/978-3-...Part of book or chapter of book . 2018 . Peer-reviewedLicense: Springer TDMData sources: CrossrefMémoires en Sciences de l'Information et de la CommunicationConference object . 2015Full-Text: https://hal.science/hal-01223683/documentHyper Article en Ligne; Mémoires en Sciences de l'Information et de la CommunicationOther literature type . Part of book or chapter of book . 2018Hyper Article en Ligne - Sciences de l'Homme et de la Société; Hal-DiderotPart of book or chapter of book . 2018add ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/978-3-319-93782-3_5&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu3 citations 3 popularity Average influence Average impulse Average Powered by BIP!more_vert Hyper Article en Lig... arrow_drop_down https://doi.org/10.1007/978-3-...Part of book or chapter of book . 2018 . Peer-reviewedLicense: Springer TDMData sources: CrossrefMémoires en Sciences de l'Information et de la CommunicationConference object . 2015Full-Text: https://hal.science/hal-01223683/documentHyper Article en Ligne; Mémoires en Sciences de l'Information et de la CommunicationOther literature type . Part of book or chapter of book . 2018Hyper Article en Ligne - Sciences de l'Homme et de la Société; Hal-DiderotPart of book or chapter of book . 2018add ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/978-3-319-93782-3_5&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Part of book or chapter of book , Conference object 2020 FrancePublisher:Springer International Publishing Authors: Larroche, Corentin; Mazel, Johan; Clémençon, Stéphan;Larroche, Corentin; Mazel, Johan; Clémençon, Stéphan;The ability to detect an unusual concentration of extreme observations in a connected region of a graph is fundamental in a number of use cases, ranging from traffic accident detection in road networks to intrusion detection in computer networks. This task is usually performed using scan statistics-based methods, which require explicitly finding the most anomalous subgraph and thus are computationally intensive.
https://doi.org/10.1... arrow_drop_down https://doi.org/10.1007/978-3-...Part of book or chapter of book . 2020 . Peer-reviewedLicense: CC BYData sources: Crossrefhttps://link.springer.com/cont...Part of book or chapter of bookLicense: CC BYData sources: UnpayWallHyper Article en Ligne; Hal-DiderotOther literature type . Conference object . 2020Mémoires en Sciences de l'Information et de la CommunicationConference object . 2020add ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/978-3-030-44584-3_23&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.euAccess Routeshybrid 0 citations 0 popularity Average influence Average impulse Average Powered by BIP!more_vert https://doi.org/10.1... arrow_drop_down https://doi.org/10.1007/978-3-...Part of book or chapter of book . 2020 . Peer-reviewedLicense: CC BYData sources: Crossrefhttps://link.springer.com/cont...Part of book or chapter of bookLicense: CC BYData sources: UnpayWallHyper Article en Ligne; Hal-DiderotOther literature type . Conference object . 2020Mémoires en Sciences de l'Information et de la CommunicationConference object . 2020add ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/978-3-030-44584-3_23&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Part of book or chapter of book , Conference object , Preprint , Article 2018 FrancePublisher:Springer International Publishing Authors: Delivorias, Stathis; Leclère, Michel; Mugnier, Marie-Laure; Ulliana, Federico;Delivorias, Stathis; Leclère, Michel; Mugnier, Marie-Laure; Ulliana, Federico;The chase is a fundamental tool for existential rules. Several chase variants are known, which differ on how they handle redundancies possibly caused by the introduction of nulls. Given a chase variant, the halting problem takes as input a set of existential rules and asks if this set of rules ensures the termination of the chase for any factbase. It is well-known that this problem is undecidable for all known chase variants. The related problem of boundedness asks if a given set of existential rules is bounded, i.e., whether there is a predefined upper bound on the number of (breadth-first) steps of the chase, independently from any factbase. This problem is already undecidable in the specific case of datalog rules. However, knowing that a set of rules is bounded for some chase variant does not help much in practice if the bound is unknown. Hence, in this paper, we investigate the decidability of the k-boundedness problem, which asks whether a given set of rules is bounded by an integer k. We prove that k-boundedness is decidable for three chase variants, namely the oblivious, semi-oblivious and restricted chase. Comment: 20 pages, revised version of the paper published at RuleML+RR 2018
http://arxiv.org/pdf... arrow_drop_down https://doi.org/10.1007/978-3-...Part of book or chapter of book . 2018 . Peer-reviewedLicense: Springer TDMData sources: Crossrefhttps://doi.org/10.48550/arxiv...Article . 2018License: arXiv Non-Exclusive DistributionData sources: Dataciteadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/978-3-319-99906-7_4&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.euAccess RoutesGreen 3 citations 3 popularity Average influence Average impulse Average Powered by BIP!more_vert http://arxiv.org/pdf... arrow_drop_down https://doi.org/10.1007/978-3-...Part of book or chapter of book . 2018 . Peer-reviewedLicense: Springer TDMData sources: Crossrefhttps://doi.org/10.48550/arxiv...Article . 2018License: arXiv Non-Exclusive DistributionData sources: Dataciteadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/978-3-319-99906-7_4&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Conference object , Part of book or chapter of book 2019Publisher:Springer International Publishing Authors: Mohammed Khwaja; Sarah Shepherd;Mohammed Khwaja; Sarah Shepherd;Part 10: Interactive Posters; International audience; This paper presents an experiment to obtain personality traits using a psychometric questionnaire that is augmented with visual representations that support answer options. From the results, it is suggested that the use of visual media improves participants’ perception of ‘fun’ or pleasure, while answering the questionnaire; thereby creating the potential to improve user engagement in commercial applications.
https://doi.org/10.1... arrow_drop_down https://doi.org/10.1007/978-3-...Part of book or chapter of book . 2019 . Peer-reviewedLicense: Springer Nature TDMData sources: CrossrefMémoires en Sciences de l'Information et de la CommunicationConference object . 2019License: CC BYadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/978-3-030-29390-1_49&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu0 citations 0 popularity Average influence Average impulse Average Powered by BIP!more_vert https://doi.org/10.1... arrow_drop_down https://doi.org/10.1007/978-3-...Part of book or chapter of book . 2019 . Peer-reviewedLicense: Springer Nature TDMData sources: CrossrefMémoires en Sciences de l'Information et de la CommunicationConference object . 2019License: CC BYadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/978-3-030-29390-1_49&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Conference object , Part of book or chapter of book 2020 FrancePublisher:Springer International Publishing Authors: Sujee, R.; Shanthosh, D.; Sudharsun, L.;Sujee, R.; Shanthosh, D.; Sudharsun, L.;Part 2: Computational Intelligence for Image and Video Analysis; International audience; The paper aims to classify the defects in a fabric material using deep learning and neural network methodologies. For this paper, 6 classes of defects are considered, namely, Rust, Grease, Hole, Slough, Oil Stain, and, Broken Filament. This paper has implemented both the YOLOv2 model and the YOLOv3 Tiny model separately using the same fabric data set which was collected for this research, which consists of six types of defects, and uses the convolutional weights which were pre-trained on Imagenet dataset. Observed and documented the success rate of both the model in detecting the defects in the fabric material.
https://doi.org/10.1... arrow_drop_down https://doi.org/10.1007/978-3-...Part of book or chapter of book . 2020 . Peer-reviewedLicense: Springer TDMData sources: CrossrefMémoires en Sciences de l'Information et de la Communication; Hal-DiderotConference object . 2020License: CC BYFull-Text: https://hal.inria.fr/hal-03434800/documentadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/978-3-030-63467-4_15&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu5 citations 5 popularity Top 10% influence Average impulse Average Powered by BIP!more_vert https://doi.org/10.1... arrow_drop_down https://doi.org/10.1007/978-3-...Part of book or chapter of book . 2020 . Peer-reviewedLicense: Springer TDMData sources: CrossrefMémoires en Sciences de l'Information et de la Communication; Hal-DiderotConference object . 2020License: CC BYFull-Text: https://hal.inria.fr/hal-03434800/documentadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/978-3-030-63467-4_15&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Preprint , Part of book or chapter of book , Conference object , Article 2019 FrancePublisher:Springer International Publishing Authors: Pinard, Clément; Chevalley, Laure; Manzanera, Antoine; Filliat, David;Pinard, Clément; Chevalley, Laure; Manzanera, Antoine; Filliat, David;International audience; This work is based on a questioning of the quality metrics used by deep neural networks performing depth prediction from a single image, and then of the usability of recently published works on unsu-pervised learning of depth from videos. These works are all predicting depth from a single image, thus it is only known up to an undetermined scale factor, which is not sufficient for practical use cases that need an absolute depth map, i.e. the determination of the scaling factor. To overcome these limitations, we propose to learn in the same unsupervised manner a depth map inference system from monocular videos that takes a pair of images as input. This algorithm actually learns structure-from-motion from motion, and not only structure from context appearance. The scale factor issue is explicitly treated, and the absolute depth map can be estimated from camera displacement magnitude, which can be easily measured from cheap external sensors. Our solution is also much more robust with respect to domain variation and adaptation via fine tuning, because it does not rely entirely on depth from context. Two use cases are considered, unstabilized moving camera videos, and stabilized ones. This choice is motivated by the UAV (for Unmanned Aerial Vehicle) use case that generally provides reliable orientation measurement. We provide a set of experiments showing that, used in real conditions where only speed can be known, our network outperforms competitors for most depth quality measures. Results are given on the well known KITTI dataset [5], which provides robust stabilization for our second use case, but also contains moving scenes which are very typical of the in-car road context. We then present results on a synthetic dataset that we believe to be more representative of typical UAV scenes. Lastly, we present two domain adaptation use cases showing superior robustness of our method compared to single view depth algorithms, which indicates that it is better suited for highly variable visual contexts.
Hyper Article en Lig... arrow_drop_down Hyper Article en Ligne; Hal-DiderotOther literature type . Conference object . 2018https://doi.org/10.1007/978-3-...Part of book or chapter of book . 2019 . Peer-reviewedLicense: Springer Nature TDMData sources: CrossrefMémoires en Sciences de l'Information et de la CommunicationConference object . 2018Full-Text: https://hal.science/hal-01995833/documenthttps://doi.org/10.48550/arxiv...Article . 2018License: arXiv Non-Exclusive DistributionData sources: Dataciteadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/978-3-030-11015-4_27&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.euAccess RoutesGreen 9 citations 9 popularity Top 10% influence Top 10% impulse Top 10% Powered by BIP!more_vert Hyper Article en Lig... arrow_drop_down Hyper Article en Ligne; Hal-DiderotOther literature type . Conference object . 2018https://doi.org/10.1007/978-3-...Part of book or chapter of book . 2019 . Peer-reviewedLicense: Springer Nature TDMData sources: CrossrefMémoires en Sciences de l'Information et de la CommunicationConference object . 2018Full-Text: https://hal.science/hal-01995833/documenthttps://doi.org/10.48550/arxiv...Article . 2018License: arXiv Non-Exclusive DistributionData sources: Dataciteadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/978-3-030-11015-4_27&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Part of book or chapter of book , Conference object , Preprint 2018 FrancePublisher:Springer International Publishing Authors: Oztürk, Aybükë; Lallich, Stéphane; Darmont, Jérôme; Waksman, Sylvie Yona;Oztürk, Aybükë; Lallich, Stéphane; Darmont, Jérôme; Waksman, Sylvie Yona;Clustering is an extensive research area in data science. The aim of clustering is to discover groups and to identify interesting patterns in datasets. Crisp (hard) clustering considers that each data point belongs to one and only one cluster. However, it is inadequate as some data points may belong to several clusters, as is the case in text categorization. Thus, we need more flexible clustering. Fuzzy clustering methods, where each data point can belong to several clusters, are an interesting alternative. Yet, seeding iterative fuzzy algorithms to achieve high quality clustering is an issue. In this paper, we propose a new linear and efficient initialization algorithm MaxMin Linear to deal with this problem. Then, we validate our theoretical results through extensive experiments on a variety of numerical real-world and artificial datasets. We also test several validity indices, including a new validity index that we propose, Transformed Standardized Fuzzy Difference (TSFD). International audience
arXiv.org e-Print Ar... arrow_drop_down https://doi.org/10.1007/978-3-...Part of book or chapter of book . 2018 . Peer-reviewedLicense: Springer TDMData sources: CrossrefMémoires en Sciences de l'Information et de la Communication; HAL Lumiere Lyon 2Conference object . 2018License: CC BYFull-Text: https://hal.science/hal-01771204/documentadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/978-3-319-96136-1_1&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.euAccess RoutesGreen 0 citations 0 popularity Average influence Average impulse Average Powered by BIP!more_vert arXiv.org e-Print Ar... arrow_drop_down https://doi.org/10.1007/978-3-...Part of book or chapter of book . 2018 . Peer-reviewedLicense: Springer TDMData sources: CrossrefMémoires en Sciences de l'Information et de la Communication; HAL Lumiere Lyon 2Conference object . 2018License: CC BYFull-Text: https://hal.science/hal-01771204/documentadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/978-3-319-96136-1_1&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Part of book or chapter of book 2021 FrancePublisher:Springer International Publishing Buffa, Michel; Cabrio, Elena; Fell, Michael; Gandon, Fabien; Giboin, Alain; Hennequin, Romain; Michel, Franck; Pauwels, Johan; Pellerin, Guillaume; Tikat, Maroua; Winckler, Marco;International audience; Since 2017, the goal of the two-million song WASABI database has been to build a knowledge graph linking collected metadata (artists,discography, producers, dates, etc.) with metadata generated by the analysis of both the songs’ lyrics (topics, places, emotions, structure, etc.) and audio signal (chords, sound, etc.). It relies on natural language processing and machine learning methods for extraction, and semantic Web frameworks for representation and integration. It describes more than 2 millions commercial songs, 200K albums and 77K artists. It can be exploited by music search engines, music professionals (e.g. journalists, radio presenters, music teachers) or scientists willing to analyze popular music published since 1950. It is available under an open license, inmultiple formats and with online and open source services including aninteractive navigator, a REST API and a SPARQL endpoint.
Hal-Diderot arrow_drop_down https://doi.org/10.1007/978-3-...Part of book or chapter of book . 2021 . Peer-reviewedLicense: Springer TDMData sources: CrossrefHAL-Rennes 1; INRIA a CCSD electronic archive server; Mémoires en Sciences de l'Information et de la CommunicationPart of book or chapter of book . 2021Full-Text: https://hal.science/hal-03282619/documentadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/978-3-030-77385-4_31&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu6 citations 6 popularity Top 10% influence Average impulse Top 10% Powered by BIP!more_vert Hal-Diderot arrow_drop_down https://doi.org/10.1007/978-3-...Part of book or chapter of book . 2021 . Peer-reviewedLicense: Springer TDMData sources: CrossrefHAL-Rennes 1; INRIA a CCSD electronic archive server; Mémoires en Sciences de l'Information et de la CommunicationPart of book or chapter of book . 2021Full-Text: https://hal.science/hal-03282619/documentadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/978-3-030-77385-4_31&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Conference object , Other literature type , Part of book or chapter of book 2018 FrancePublisher:Springer International Publishing Funded by:EC | ECRYPT-NETEC| ECRYPT-NETAuthors: Géraud, Rémi; Naccache, David; Roşie, Răzvan;Géraud, Rémi; Naccache, David; Roşie, Răzvan;International audience; Keeping track of financial transactions (e.g., in banks and blockchains) means keeping track of an ever-increasing list of exchanges between accounts. In fact, many of these transactions can be safely " forgotten " , in the sense that purging a set of them that compensate each other does not impact the network's semantic meaning (e.g., the accounts' balances). We call nilcatenation a collection of transactions having no effect on a network's semantics. Such exchanges may be archived and removed, yielding a smaller, but equivalent ledger. Motivated by the computational and analytic benefits obtained from more compact representations of numerical data, we formalize the problem of finding nilcatenations, and propose detection methods based on graph and lattice-reduction techniques. Atop interesting applications of this work (e.g., decoupling of centralized and distributed databases), we also discuss the original idea of a " community-serving proof of work " : finding nilcatenations constitutes a proof of useful work, as the periodic removal of nilcatenations reduces the transactional graph's size.
Hyper Article en Lig... arrow_drop_down Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications EngineeringOther literature type . Part of book or chapter of book . 2018 . Peer-reviewedLicense: Springer TDMHal-DiderotConference object . 2017Full-Text: https://hal.inria.fr/hal-01668213/documentData sources: Hal-Diderotadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/978-3-319-78813-5_6&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu3 citations 3 popularity Average influence Average impulse Average Powered by BIP!more_vert Hyper Article en Lig... arrow_drop_down Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications EngineeringOther literature type . Part of book or chapter of book . 2018 . Peer-reviewedLicense: Springer TDMHal-DiderotConference object . 2017Full-Text: https://hal.inria.fr/hal-01668213/documentData sources: Hal-Diderotadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/978-3-319-78813-5_6&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Part of book or chapter of book 2019 FrancePublisher:Springer International Publishing Authors: Gavin, Gerald; Bonnevay, Stéphane;Gavin, Gerald; Bonnevay, Stéphane;Many cryptographic constructions are based on the famous problem LWE [Reg05]. In particular, this cryptographic problem is currently the most relevant to build FHE [GSW13, BV11]. In [BV11], encrypting x consists of randomly choosing a vector \(\varvec{c}\) satisfying \(\langle \varvec{s},\varvec{c}\rangle =x+\textsf {noise}\pmod q\) where \(\varvec{s}\) is a secret size-n vector. While the vector sum is a homomorphic operator, such a scheme is intrinsically vulnerable to lattice-based attacks. To overcome this, we propose to define \(\varvec{c}\) as a pair of vectors \((\varvec{u},\varvec{v})\) satisfying \(\langle \varvec{s},\varvec{u}\rangle /\langle \varvec{s},\varvec{v}\rangle =x+\textsf {noise}\pmod q\). This simple scheme is based on a new cryptographic problem intuitively not easier than LWE, called Fractional LWE (FLWE). While some homomorphic properties are lost, the secret vector \(\varvec{s}\) could be hopefully chosen shorter leading to more efficient constructions. We extensively study the hardness of FLWE. We first prove that the decision and search versions are equivalent provided q is a small prime. We then propose lattice-based cryptanalysis showing that n could be chosen logarithmic in \(\log q\) instead of polynomial for LWE.
https://doi.org/10.1... arrow_drop_down https://doi.org/10.1007/978-3-...Part of book or chapter of book . 2019 . Peer-reviewedLicense: Springer TDMData sources: CrossrefMémoires en Sciences de l'Information et de la Communication; HAL Lumiere Lyon 2Part of book or chapter of book . 2019add ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/978-3-030-31578-8_20&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu0 citations 0 popularity Average influence Average impulse Average Powered by BIP!more_vert https://doi.org/10.1... arrow_drop_down https://doi.org/10.1007/978-3-...Part of book or chapter of book . 2019 . Peer-reviewedLicense: Springer TDMData sources: CrossrefMémoires en Sciences de l'Information et de la Communication; HAL Lumiere Lyon 2Part of book or chapter of book . 2019add ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/978-3-030-31578-8_20&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu
Loading
description Publicationkeyboard_double_arrow_right Conference object , Part of book or chapter of book , Other literature type 2018 FrancePublisher:Springer International Publishing Authors: Czerpowicka, Monika; Savary, Agata;Czerpowicka, Monika; Savary, Agata;International audience; We present SEJF, a lexical resource of Polish nominal, adjectival and adverbial multi-word expressions. It consists of an intensional module with about 4,700 multi-word lemmas assigned to 160 inflection graphs, and an extensional module with 88,000 automatically generated inflected forms annotated with grammatical tags. We show the results of its coverage evaluation against an annotated corpus. The resource is freely available under the Creative Commons BY-SA license.
Hyper Article en Lig... arrow_drop_down https://doi.org/10.1007/978-3-...Part of book or chapter of book . 2018 . Peer-reviewedLicense: Springer TDMData sources: CrossrefMémoires en Sciences de l'Information et de la CommunicationConference object . 2015Full-Text: https://hal.science/hal-01223683/documentHyper Article en Ligne; Mémoires en Sciences de l'Information et de la CommunicationOther literature type . Part of book or chapter of book . 2018Hyper Article en Ligne - Sciences de l'Homme et de la Société; Hal-DiderotPart of book or chapter of book . 2018add ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/978-3-319-93782-3_5&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu3 citations 3 popularity Average influence Average impulse Average Powered by BIP!more_vert Hyper Article en Lig... arrow_drop_down https://doi.org/10.1007/978-3-...Part of book or chapter of book . 2018 . Peer-reviewedLicense: Springer TDMData sources: CrossrefMémoires en Sciences de l'Information et de la CommunicationConference object . 2015Full-Text: https://hal.science/hal-01223683/documentHyper Article en Ligne; Mémoires en Sciences de l'Information et de la CommunicationOther literature type . Part of book or chapter of book . 2018Hyper Article en Ligne - Sciences de l'Homme et de la Société; Hal-DiderotPart of book or chapter of book . 2018add ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/978-3-319-93782-3_5&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Part of book or chapter of book , Conference object 2020 FrancePublisher:Springer International Publishing Authors: Larroche, Corentin; Mazel, Johan; Clémençon, Stéphan;Larroche, Corentin; Mazel, Johan; Clémençon, Stéphan;The ability to detect an unusual concentration of extreme observations in a connected region of a graph is fundamental in a number of use cases, ranging from traffic accident detection in road networks to intrusion detection in computer networks. This task is usually performed using scan statistics-based methods, which require explicitly finding the most anomalous subgraph and thus are computationally intensive.
https://doi.org/10.1... arrow_drop_down https://doi.org/10.1007/978-3-...Part of book or chapter of book . 2020 . Peer-reviewedLicense: CC BYData sources: Crossrefhttps://link.springer.com/cont...Part of book or chapter of bookLicense: CC BYData sources: UnpayWallHyper Article en Ligne; Hal-DiderotOther literature type . Conference object . 2020Mémoires en Sciences de l'Information et de la CommunicationConference object . 2020add ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/978-3-030-44584-3_23&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.euAccess Routeshybrid 0 citations 0 popularity Average influence Average impulse Average Powered by BIP!more_vert https://doi.org/10.1... arrow_drop_down https://doi.org/10.1007/978-3-...Part of book or chapter of book . 2020 . Peer-reviewedLicense: CC BYData sources: Crossrefhttps://link.springer.com/cont...Part of book or chapter of bookLicense: CC BYData sources: UnpayWallHyper Article en Ligne; Hal-DiderotOther literature type . Conference object . 2020Mémoires en Sciences de l'Information et de la CommunicationConference object . 2020add ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/978-3-030-44584-3_23&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Part of book or chapter of book , Conference object , Preprint , Article 2018 FrancePublisher:Springer International Publishing Authors: Delivorias, Stathis; Leclère, Michel; Mugnier, Marie-Laure; Ulliana, Federico;Delivorias, Stathis; Leclère, Michel; Mugnier, Marie-Laure; Ulliana, Federico;The chase is a fundamental tool for existential rules. Several chase variants are known, which differ on how they handle redundancies possibly caused by the introduction of nulls. Given a chase variant, the halting problem takes as input a set of existential rules and asks if this set of rules ensures the termination of the chase for any factbase. It is well-known that this problem is undecidable for all known chase variants. The related problem of boundedness asks if a given set of existential rules is bounded, i.e., whether there is a predefined upper bound on the number of (breadth-first) steps of the chase, independently from any factbase. This problem is already undecidable in the specific case of datalog rules. However, knowing that a set of rules is bounded for some chase variant does not help much in practice if the bound is unknown. Hence, in this paper, we investigate the decidability of the k-boundedness problem, which asks whether a given set of rules is bounded by an integer k. We prove that k-boundedness is decidable for three chase variants, namely the oblivious, semi-oblivious and restricted chase. Comment: 20 pages, revised version of the paper published at RuleML+RR 2018
http://arxiv.org/pdf... arrow_drop_down https://doi.org/10.1007/978-3-...Part of book or chapter of book . 2018 . Peer-reviewedLicense: Springer TDMData sources: Crossrefhttps://doi.org/10.48550/arxiv...Article . 2018License: arXiv Non-Exclusive DistributionData sources: Dataciteadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/978-3-319-99906-7_4&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.euAccess RoutesGreen 3 citations 3 popularity Average influence Average impulse Average Powered by BIP!more_vert http://arxiv.org/pdf... arrow_drop_down https://doi.org/10.1007/978-3-...Part of book or chapter of book . 2018 . Peer-reviewedLicense: Springer TDMData sources: Crossrefhttps://doi.org/10.48550/arxiv...Article . 2018License: arXiv Non-Exclusive DistributionData sources: Dataciteadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/978-3-319-99906-7_4&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Conference object , Part of book or chapter of book 2019Publisher:Springer International Publishing Authors: Mohammed Khwaja; Sarah Shepherd;Mohammed Khwaja; Sarah Shepherd;Part 10: Interactive Posters; International audience; This paper presents an experiment to obtain personality traits using a psychometric questionnaire that is augmented with visual representations that support answer options. From the results, it is suggested that the use of visual media improves participants’ perception of ‘fun’ or pleasure, while answering the questionnaire; thereby creating the potential to improve user engagement in commercial applications.
https://doi.org/10.1... arrow_drop_down https://doi.org/10.1007/978-3-...Part of book or chapter of book . 2019 . Peer-reviewedLicense: Springer Nature TDMData sources: CrossrefMémoires en Sciences de l'Information et de la CommunicationConference object . 2019License: CC BYadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/978-3-030-29390-1_49&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu0 citations 0 popularity Average influence Average impulse Average Powered by BIP!more_vert https://doi.org/10.1... arrow_drop_down https://doi.org/10.1007/978-3-...Part of book or chapter of book . 2019 . Peer-reviewedLicense: Springer Nature TDMData sources: CrossrefMémoires en Sciences de l'Information et de la CommunicationConference object . 2019License: CC BYadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/978-3-030-29390-1_49&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Conference object , Part of book or chapter of book 2020 FrancePublisher:Springer International Publishing Authors: Sujee, R.; Shanthosh, D.; Sudharsun, L.;Sujee, R.; Shanthosh, D.; Sudharsun, L.;Part 2: Computational Intelligence for Image and Video Analysis; International audience; The paper aims to classify the defects in a fabric material using deep learning and neural network methodologies. For this paper, 6 classes of defects are considered, namely, Rust, Grease, Hole, Slough, Oil Stain, and, Broken Filament. This paper has implemented both the YOLOv2 model and the YOLOv3 Tiny model separately using the same fabric data set which was collected for this research, which consists of six types of defects, and uses the convolutional weights which were pre-trained on Imagenet dataset. Observed and documented the success rate of both the model in detecting the defects in the fabric material.
https://doi.org/10.1... arrow_drop_down https://doi.org/10.1007/978-3-...Part of book or chapter of book . 2020 . Peer-reviewedLicense: Springer TDMData sources: CrossrefMémoires en Sciences de l'Information et de la Communication; Hal-DiderotConference object . 2020License: CC BYFull-Text: https://hal.inria.fr/hal-03434800/documentadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/978-3-030-63467-4_15&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu5 citations 5 popularity Top 10% influence Average impulse Average Powered by BIP!more_vert https://doi.org/10.1... arrow_drop_down https://doi.org/10.1007/978-3-...Part of book or chapter of book . 2020 . Peer-reviewedLicense: Springer TDMData sources: CrossrefMémoires en Sciences de l'Information et de la Communication; Hal-DiderotConference object . 2020License: CC BYFull-Text: https://hal.inria.fr/hal-03434800/documentadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/978-3-030-63467-4_15&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Preprint , Part of book or chapter of book , Conference object , Article 2019 FrancePublisher:Springer International Publishing Authors: Pinard, Clément; Chevalley, Laure; Manzanera, Antoine; Filliat, David;Pinard, Clément; Chevalley, Laure; Manzanera, Antoine; Filliat, David;International audience; This work is based on a questioning of the quality metrics used by deep neural networks performing depth prediction from a single image, and then of the usability of recently published works on unsu-pervised learning of depth from videos. These works are all predicting depth from a single image, thus it is only known up to an undetermined scale factor, which is not sufficient for practical use cases that need an absolute depth map, i.e. the determination of the scaling factor. To overcome these limitations, we propose to learn in the same unsupervised manner a depth map inference system from monocular videos that takes a pair of images as input. This algorithm actually learns structure-from-motion from motion, and not only structure from context appearance. The scale factor issue is explicitly treated, and the absolute depth map can be estimated from camera displacement magnitude, which can be easily measured from cheap external sensors. Our solution is also much more robust with respect to domain variation and adaptation via fine tuning, because it does not rely entirely on depth from context. Two use cases are considered, unstabilized moving camera videos, and stabilized ones. This choice is motivated by the UAV (for Unmanned Aerial Vehicle) use case that generally provides reliable orientation measurement. We provide a set of experiments showing that, used in real conditions where only speed can be known, our network outperforms competitors for most depth quality measures. Results are given on the well known KITTI dataset [5], which provides robust stabilization for our second use case, but also contains moving scenes which are very typical of the in-car road context. We then present results on a synthetic dataset that we believe to be more representative of typical UAV scenes. Lastly, we present two domain adaptation use cases showing superior robustness of our method compared to single view depth algorithms, which indicates that it is better suited for highly variable visual contexts.
Hyper Article en Lig... arrow_drop_down Hyper Article en Ligne; Hal-DiderotOther literature type . Conference object . 2018https://doi.org/10.1007/978-3-...Part of book or chapter of book . 2019 . Peer-reviewedLicense: Springer Nature TDMData sources: CrossrefMémoires en Sciences de l'Information et de la CommunicationConference object . 2018Full-Text: https://hal.science/hal-01995833/documenthttps://doi.org/10.48550/arxiv...Article . 2018License: arXiv Non-Exclusive DistributionData sources: Dataciteadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/978-3-030-11015-4_27&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.euAccess RoutesGreen 9 citations 9 popularity Top 10% influence Top 10% impulse Top 10% Powered by BIP!more_vert Hyper Article en Lig... arrow_drop_down Hyper Article en Ligne; Hal-DiderotOther literature type . Conference object . 2018https://doi.org/10.1007/978-3-...Part of book or chapter of book . 2019 . Peer-reviewedLicense: Springer Nature TDMData sources: CrossrefMémoires en Sciences de l'Information et de la CommunicationConference object . 2018Full-Text: https://hal.science/hal-01995833/documenthttps://doi.org/10.48550/arxiv...Article . 2018License: arXiv Non-Exclusive DistributionData sources: Dataciteadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/978-3-030-11015-4_27&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Part of book or chapter of book , Conference object , Preprint 2018 FrancePublisher:Springer International Publishing Authors: Oztürk, Aybükë; Lallich, Stéphane; Darmont, Jérôme; Waksman, Sylvie Yona;Oztürk, Aybükë; Lallich, Stéphane; Darmont, Jérôme; Waksman, Sylvie Yona;Clustering is an extensive research area in data science. The aim of clustering is to discover groups and to identify interesting patterns in datasets. Crisp (hard) clustering considers that each data point belongs to one and only one cluster. However, it is inadequate as some data points may belong to several clusters, as is the case in text categorization. Thus, we need more flexible clustering. Fuzzy clustering methods, where each data point can belong to several clusters, are an interesting alternative. Yet, seeding iterative fuzzy algorithms to achieve high quality clustering is an issue. In this paper, we propose a new linear and efficient initialization algorithm MaxMin Linear to deal with this problem. Then, we validate our theoretical results through extensive experiments on a variety of numerical real-world and artificial datasets. We also test several validity indices, including a new validity index that we propose, Transformed Standardized Fuzzy Difference (TSFD). International audience
arXiv.org e-Print Ar... arrow_drop_down https://doi.org/10.1007/978-3-...Part of book or chapter of book . 2018 . Peer-reviewedLicense: Springer TDMData sources: CrossrefMémoires en Sciences de l'Information et de la Communication; HAL Lumiere Lyon 2Conference object . 2018License: CC BYFull-Text: https://hal.science/hal-01771204/documentadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/978-3-319-96136-1_1&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.euAccess RoutesGreen 0 citations 0 popularity Average influence Average impulse Average Powered by BIP!more_vert arXiv.org e-Print Ar... arrow_drop_down https://doi.org/10.1007/978-3-...Part of book or chapter of book . 2018 . Peer-reviewedLicense: Springer TDMData sources: CrossrefMémoires en Sciences de l'Information et de la Communication; HAL Lumiere Lyon 2Conference object . 2018License: CC BYFull-Text: https://hal.science/hal-01771204/documentadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/978-3-319-96136-1_1&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Part of book or chapter of book 2021 FrancePublisher:Springer International Publishing Buffa, Michel; Cabrio, Elena; Fell, Michael; Gandon, Fabien; Giboin, Alain; Hennequin, Romain; Michel, Franck; Pauwels, Johan; Pellerin, Guillaume; Tikat, Maroua; Winckler, Marco;International audience; Since 2017, the goal of the two-million song WASABI database has been to build a knowledge graph linking collected metadata (artists,discography, producers, dates, etc.) with metadata generated by the analysis of both the songs’ lyrics (topics, places, emotions, structure, etc.) and audio signal (chords, sound, etc.). It relies on natural language processing and machine learning methods for extraction, and semantic Web frameworks for representation and integration. It describes more than 2 millions commercial songs, 200K albums and 77K artists. It can be exploited by music search engines, music professionals (e.g. journalists, radio presenters, music teachers) or scientists willing to analyze popular music published since 1950. It is available under an open license, inmultiple formats and with online and open source services including aninteractive navigator, a REST API and a SPARQL endpoint.
Hal-Diderot arrow_drop_down https://doi.org/10.1007/978-3-...Part of book or chapter of book . 2021 . Peer-reviewedLicense: Springer TDMData sources: CrossrefHAL-Rennes 1; INRIA a CCSD electronic archive server; Mémoires en Sciences de l'Information et de la CommunicationPart of book or chapter of book . 2021Full-Text: https://hal.science/hal-03282619/documentadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/978-3-030-77385-4_31&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu6 citations 6 popularity Top 10% influence Average impulse Top 10% Powered by BIP!more_vert Hal-Diderot arrow_drop_down https://doi.org/10.1007/978-3-...Part of book or chapter of book . 2021 . Peer-reviewedLicense: Springer TDMData sources: CrossrefHAL-Rennes 1; INRIA a CCSD electronic archive server; Mémoires en Sciences de l'Information et de la CommunicationPart of book or chapter of book . 2021Full-Text: https://hal.science/hal-03282619/documentadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/978-3-030-77385-4_31&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Conference object , Other literature type , Part of book or chapter of book 2018 FrancePublisher:Springer International Publishing Funded by:EC | ECRYPT-NETEC| ECRYPT-NETAuthors: Géraud, Rémi; Naccache, David; Roşie, Răzvan;Géraud, Rémi; Naccache, David; Roşie, Răzvan;International audience; Keeping track of financial transactions (e.g., in banks and blockchains) means keeping track of an ever-increasing list of exchanges between accounts. In fact, many of these transactions can be safely " forgotten " , in the sense that purging a set of them that compensate each other does not impact the network's semantic meaning (e.g., the accounts' balances). We call nilcatenation a collection of transactions having no effect on a network's semantics. Such exchanges may be archived and removed, yielding a smaller, but equivalent ledger. Motivated by the computational and analytic benefits obtained from more compact representations of numerical data, we formalize the problem of finding nilcatenations, and propose detection methods based on graph and lattice-reduction techniques. Atop interesting applications of this work (e.g., decoupling of centralized and distributed databases), we also discuss the original idea of a " community-serving proof of work " : finding nilcatenations constitutes a proof of useful work, as the periodic removal of nilcatenations reduces the transactional graph's size.
Hyper Article en Lig... arrow_drop_down Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications EngineeringOther literature type . Part of book or chapter of book . 2018 . Peer-reviewedLicense: Springer TDMHal-DiderotConference object . 2017Full-Text: https://hal.inria.fr/hal-01668213/documentData sources: Hal-Diderotadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/978-3-319-78813-5_6&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu3 citations 3 popularity Average influence Average impulse Average Powered by BIP!more_vert Hyper Article en Lig... arrow_drop_down Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications EngineeringOther literature type . Part of book or chapter of book . 2018 . Peer-reviewedLicense: Springer TDMHal-DiderotConference object . 2017Full-Text: https://hal.inria.fr/hal-01668213/documentData sources: Hal-Diderotadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/978-3-319-78813-5_6&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Part of book or chapter of book 2019 FrancePublisher:Springer International Publishing Authors: Gavin, Gerald; Bonnevay, Stéphane;Gavin, Gerald; Bonnevay, Stéphane;Many cryptographic constructions are based on the famous problem LWE [Reg05]. In particular, this cryptographic problem is currently the most relevant to build FHE [GSW13, BV11]. In [BV11], encrypting x consists of randomly choosing a vector \(\varvec{c}\) satisfying \(\langle \varvec{s},\varvec{c}\rangle =x+\textsf {noise}\pmod q\) where \(\varvec{s}\) is a secret size-n vector. While the vector sum is a homomorphic operator, such a scheme is intrinsically vulnerable to lattice-based attacks. To overcome this, we propose to define \(\varvec{c}\) as a pair of vectors \((\varvec{u},\varvec{v})\) satisfying \(\langle \varvec{s},\varvec{u}\rangle /\langle \varvec{s},\varvec{v}\rangle =x+\textsf {noise}\pmod q\). This simple scheme is based on a new cryptographic problem intuitively not easier than LWE, called Fractional LWE (FLWE). While some homomorphic properties are lost, the secret vector \(\varvec{s}\) could be hopefully chosen shorter leading to more efficient constructions. We extensively study the hardness of FLWE. We first prove that the decision and search versions are equivalent provided q is a small prime. We then propose lattice-based cryptanalysis showing that n could be chosen logarithmic in \(\log q\) instead of polynomial for LWE.
https://doi.org/10.1... arrow_drop_down https://doi.org/10.1007/978-3-...Part of book or chapter of book . 2019 . Peer-reviewedLicense: Springer TDMData sources: CrossrefMémoires en Sciences de l'Information et de la Communication; HAL Lumiere Lyon 2Part of book or chapter of book . 2019add ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/978-3-030-31578-8_20&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu0 citations 0 popularity Average influence Average impulse Average Powered by BIP!more_vert https://doi.org/10.1... arrow_drop_down https://doi.org/10.1007/978-3-...Part of book or chapter of book . 2019 . Peer-reviewedLicense: Springer TDMData sources: CrossrefMémoires en Sciences de l'Information et de la Communication; HAL Lumiere Lyon 2Part of book or chapter of book . 2019add ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/978-3-030-31578-8_20&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu