- home
- Advanced Search
- EDIH Adria
- Publications
- Research data
- Conference object
- EU
- Mémoires en Sciences de l'Informati...
- EDIH Adria
- Publications
- Research data
- Conference object
- EU
- Mémoires en Sciences de l'Informati...
Loading
description Publicationkeyboard_double_arrow_right Conference object , Article 2021 FrancePublisher:ACM Funded by:EC | ParisRegionFPEC| ParisRegionFPMaximilian Böther; Leon Schiller; Philipp Fischbeck; Louise Molitor; Martin S. Krejca; Tobias Friedrich;International audience; Traffic congestion is a major issue that can be solved by suggesting drivers alternative routes they are willing to take. This concept has been formalized as a strategic routing problem in which a single alternative route is suggested to an existing one. We extend this formalization and introduce the Multiple-Routes problem, which is given a start and destination and aims at finding up to n different routes that the drivers strategically disperse over, minimizing the overall travel time of the system.Due to the NP-hard nature of the problem, we introduce the Multiple-Routes evolutionary algorithm (MREA) as a heuristic solver. We study several mutation and crossover operators and evaluate them on real-world data of Berlin, Germany. We find that a combination of all operators yields the best result, improving the overall travel time by a factor between 1.8 and 3, in the median, compared to all drivers taking the fastest route. For the base case n = 2, we compare our MREA to the highly tailored optimal solver by Bläsius et al. [ATMOS 2020] and show that, in the median, our approach finds solutions of quality at least 99.69 % of an optimal solution while only requiring 40 % of the time.
https://dl.acm.org/d... arrow_drop_down IEEE Transactions on Evolutionary ComputationArticle . 2023 . Peer-reviewedLicense: IEEE CopyrightData sources: CrossrefMémoires en Sciences de l'Information et de la CommunicationConference object . 2021Full-Text: https://hal.science/hal-03201943/documentMémoires en Sciences de l'Information et de la CommunicationArticle . 2022Full-Text: https://hal.science/hal-03904251/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.1145/3449639.3459307&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.euAccess Routesbronze 2 citations 2 popularity Average influence Average impulse Average Powered by BIP!more_vert https://dl.acm.org/d... arrow_drop_down IEEE Transactions on Evolutionary ComputationArticle . 2023 . Peer-reviewedLicense: IEEE CopyrightData sources: CrossrefMémoires en Sciences de l'Information et de la CommunicationConference object . 2021Full-Text: https://hal.science/hal-03201943/documentMémoires en Sciences de l'Information et de la CommunicationArticle . 2022Full-Text: https://hal.science/hal-03904251/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.1145/3449639.3459307&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Article , Preprint , Conference object 2021 FrancePublisher:ACM Funded by:EC | VeriDreamEC| VeriDreamAuthors: Achkan, Salehi; Coninx, Alexandre; Doncieux, Stephane;Achkan, Salehi; Coninx, Alexandre; Doncieux, Stephane;As open-ended learning based on divergent search algorithms such as Novelty Search (NS) draws more and more attention from the research community, it is natural to expect that its application to increasingly complex real-world problems will require the exploration to operate in higher dimensional Behavior Spaces which will not necessarily be Euclidean. Novelty Search traditionally relies on k-nearest neighbours search and an archive of previously visited behavior descriptors which are assumed to live in a Euclidean space. This is problematic because of a number of issues. On one hand, Euclidean distance and Nearest-neighbour search are known to behave differently and become less meaningful in high dimensional spaces. On the other hand, the archive has to be bounded since, memory considerations aside, the computational complexity of finding nearest neighbours in that archive grows linearithmically with its size. A sub-optimal bound can result in "cycling" in the behavior space, which inhibits the progress of the exploration. Furthermore, the performance of NS depends on a number of algorithmic choices and hyperparameters, such as the strategies to add or remove elements to the archive and the number of neighbours to use in k-nn search. In this paper, we discuss an alternative approach to novelty estimation, dubbed Behavior Recognition based Novelty Search (BR-NS), which does not require an archive, makes no assumption on the metrics that can be defined in the behavior space and does not rely on nearest neighbours search. We conduct experiments to gain insight into its feasibility and dynamics as well as potential advantages over archive-based NS in terms of time complexity. Comment: Author version of the paper accepted at GECCO 21
arXiv.org e-Print Ar... arrow_drop_down https://doi.org/10.48550/arxiv...Article . 2021License: arXiv Non-Exclusive DistributionData sources: DataciteMémoires en Sciences de l'Information et de la CommunicationConference object . 2021https://doi.org/10.1145/344963...Other literature type . Conference object . 2021 . Peer-reviewedadd 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.1145/3449639.3459303&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.euAccess RoutesGreen 3 citations 3 popularity Top 10% influence Average impulse Average Powered by BIP!more_vert arXiv.org e-Print Ar... arrow_drop_down https://doi.org/10.48550/arxiv...Article . 2021License: arXiv Non-Exclusive DistributionData sources: DataciteMémoires en Sciences de l'Information et de la CommunicationConference object . 2021https://doi.org/10.1145/344963...Other literature type . Conference object . 2021 . Peer-reviewedadd 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.1145/3449639.3459303&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Conference object 2021 FrancePublisher:ACM Funded by:EC | ForM-SMArtEC| ForM-SMArtAli Asadi; Krishnendu Chatterjee; Hongfei Fu; Amir Kafshdar Goharshady; Mohammad Mahdavi;International audience; We consider the fundamental problem of reachability analysis over imperative programs with real variables. Previous works that tackle reachability are either unable to handle programs consisting of general loops (e.g. symbolic execution), or lack completeness guarantees (e.g. abstract interpretation), or are not automated (e.g. incorrectness logic). In contrast, we propose a novel approach for reachability analysis that can handle general and complex loops, is complete, and can be entirely automated for a wide family of programs. Through the notion of Inductive Reachability Witnesses (IRWs), our approach extends ideas from both invariant generation and termination to reachability analysis. We first show that our IRW-based approach is sound and complete for reachability analysis of imperative programs. Then, we focus on linear and polynomial programs and develop automated methods for synthesizing linear and polynomial IRWs. In the linear case, we follow the well-known approaches using Farkas' Lemma. Our main contribution is in the polynomial case, where we present a pushbutton semicomplete algorithm. We achieve this using a novel combination of classical theorems in real algebraic geometry, such as Putinar's Positivstellensatz and Hilbert's Strong Nullstellensatz. Finally, our experimental results show we can prove complex reachability objectives over various benchmarks that were beyond the reach of previous methods.
https://hal.archives... arrow_drop_down Mémoires en Sciences de l'Information et de la CommunicationConference object . 2021Full-Text: https://hal.science/hal-03183862/documenthttps://doi.org/10.1145/345348...Conference object . 2021 . Peer-reviewedadd 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.1145/3453483.3454076&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu9 citations 9 popularity Top 10% influence Average impulse Top 10% Powered by BIP!more_vert https://hal.archives... arrow_drop_down Mémoires en Sciences de l'Information et de la CommunicationConference object . 2021Full-Text: https://hal.science/hal-03183862/documenthttps://doi.org/10.1145/345348...Conference object . 2021 . Peer-reviewedadd 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.1145/3453483.3454076&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Conference object , Preprint , Article 2021 FrancePublisher:ACM Funded by:EC | IDEAA, EC | BigFastDataEC| IDEAA ,EC| BigFastDataAuthors: Diao, Yanlei; Guzewicz, Pawel; Manolescu, Ioana; Mazuran, Mirjana;Diao, Yanlei; Guzewicz, Pawel; Manolescu, Ioana; Mazuran, Mirjana;As large Open Data are increasingly shared as RDF graphs today, there is a growing demand to help users discover the most interesting facets of a graph, which are often hard to grasp without automatic tools. We consider the problem of automatically identifying the k most interesting aggregate queries that can be evaluated on an RDF graph, given an integer k and a user-specified interestingness function. Our problem departs from analytics in relational data warehouses in that (i) in an RDF graph we are not given but we must identify the facts, dimensions, and measures of candidate aggregates; (ii) the classical approach to efficiently evaluating multiple aggregates breaks in the face of multi-valued dimensions in RDF data. In this work, we propose an extensible end-to-end framework that enables the identification and evaluation of interesting aggregates based on a new RDF-compatible one-pass algorithm for efficiently evaluating a lattice of aggregates and a novel early-stop technique (with probabilistic guarantees) that can prune uninteresting aggregates. Experiments using both real and synthetic graphs demonstrate the ability of our framework to find interesting aggregates in a large search space, the efficiency of our algorithms (with up to 2.9x speedup over a similar pipeline based on existing algorithms), and scalability as the data size and complexity grow. Comment: Accepted for publication in proceedings of the 2021 International Conference on Management of Data (SIGMOD '21), June 20--25, 2021, Virtual Event, China
http://arxiv.org/pdf... arrow_drop_down Hal-DiderotConference object . 2021Full-Text: https://hal.inria.fr/hal-03320929/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.1145/3448016.3457307&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.euAccess RoutesGreen 3 citations 3 popularity Top 10% influence Average impulse Average Powered by BIP!more_vert http://arxiv.org/pdf... arrow_drop_down Hal-DiderotConference object . 2021Full-Text: https://hal.inria.fr/hal-03320929/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.1145/3448016.3457307&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Conference object , Article , Preprint 2021 FrancePublisher:IEEE Funded by:EC | MIP-FrontiersEC| MIP-FrontiersAuthors: Cífka, Ondřej; Ozerov, Alexey; Şimşekli, Umut; Richard, Gael;Cífka, Ondřej; Ozerov, Alexey; Şimşekli, Umut; Richard, Gael;Neural style transfer, allowing to apply the artistic style of one image to another, has become one of the most widely showcased computer vision applications shortly after its introduction. In contrast, related tasks in the music audio domain remained, until recently, largely untackled. While several style conversion methods tailored to musical signals have been proposed, most lack the 'one-shot' capability of classical image style transfer algorithms. On the other hand, the results of existing one-shot audio style transfer methods on musical inputs are not as compelling. In this work, we are specifically interested in the problem of one-shot timbre transfer. We present a novel method for this task, based on an extension of the vector-quantized variational autoencoder (VQ-VAE), along with a simple self-supervised learning strategy designed to obtain disentangled representations of timbre and pitch. We evaluate the method using a set of objective metrics and show that it is able to outperform selected baselines. Comment: ICASSP 2021. Website: https://adasp.telecom-paris.fr/s/ss-vq-vae
https://hal.telecom-... arrow_drop_down https://doi.org/10.1109/icassp...Other literature type . Conference object . 2021 . Peer-reviewedLicense: IEEE Copyrighthttps://doi.org/10.48550/arxiv...Article . 2021License: 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.1109/icassp39728.2021.9414235&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.euAccess RoutesGreen 1 citations 1 popularity Average influence Average impulse Average Powered by BIP!more_vert https://hal.telecom-... arrow_drop_down https://doi.org/10.1109/icassp...Other literature type . Conference object . 2021 . Peer-reviewedLicense: IEEE Copyrighthttps://doi.org/10.48550/arxiv...Article . 2021License: 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.1109/icassp39728.2021.9414235&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Conference object 2021 FrancePublisher:IEEE Publicly fundedFunded by:EC | RealVisionEC| RealVisionAk, Ali; Zerman, Emin; Ling, Suiyi; Le Callet, Patrick; Smolic, Aljosa;Volumetric video content has attracted increasing research interests over the last decade, as it facilitates the integration of dynamic real world content in virtual environments. Point cloud is one of the most common alternatives to represent volumetric video content. Yet, such representation requires an enormous data storage and pose significant greater pressures on compression algorithms compared to the standard 2D video. This challenge has unleashed a new wave in the development of novel point cloud compression technologies, which need to be evaluated in terms of production quality. Due to the high dimensionality of the data, evaluating the performances of relevant coding algorithms can be time consuming. This puts a barrier on optimizing coding algorithms with complex, but perceptually accurate, objective quality metrics. In this study, we thus explore the possibility of reducing temporal-dimension of the content under-evaluation, i.e., temporal sub-sampling, for objective quality evaluation without sacrificing from the correlation with the subjective opinion. In addition, we exploit different temporal pooling methods to further make the quality evaluation procedure more efficient. In total 30 different objective quality metrics were tested on the the V-SENSE volumetric video quality database. According to experimental results, there is no need to employ full frame-rate (30 fps) assessment to reach the meaningful correlation for the considered quality metrics. These observations could be referred to reduce the computation complexity regarding the evaluation and optimization of the relevant compression algorithms.
https://hal.archives... arrow_drop_down https://doi.org/10.1109/pcs508...Other literature type . Conference object . 2021 . Peer-reviewedLicense: STM Policy #29Mémoires en Sciences de l'Information et de la CommunicationConference object . 2021Full-Text: https://hal.science/hal-03206240/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.1109/pcs50896.2021.9477449&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu1 citations 1 popularity Average influence Average impulse Average Powered by BIP!more_vert https://hal.archives... arrow_drop_down https://doi.org/10.1109/pcs508...Other literature type . Conference object . 2021 . Peer-reviewedLicense: STM Policy #29Mémoires en Sciences de l'Information et de la CommunicationConference object . 2021Full-Text: https://hal.science/hal-03206240/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.1109/pcs50896.2021.9477449&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Article , Conference object , Research , Preprint 2021 France, Denmark, DenmarkPublisher:Springer Science and Business Media LLC Funded by:EC | DEDALEEC| DEDALEAuthors: Gribonval, Rémi; Kutyniok, Gitta; Nielsen, Morten; Voigtlaender, Felix;Gribonval, Rémi; Kutyniok, Gitta; Nielsen, Morten; Voigtlaender, Felix;We study the expressivity of deep neural networks. Measuring a network's complexity by its number of connections or by its number of neurons, we consider the class of functions for which the error of best approximation with networks of a given complexity decays at a certain rate when increasing the complexity budget. Using results from classical approximation theory, we show that this class can be endowed with a (quasi)-norm that makes it a linear function space, called approximation space. We establish that allowing the networks to have certain types of "skip connections" does not change the resulting approximation spaces. We also discuss the role of the network's nonlinearity (also known as activation function) on the resulting spaces, as well as the role of depth. For the popular ReLU nonlinearity and its powers, we relate the newly constructed spaces to classical Besov spaces. The established embeddings highlight that some functions of very low Besov smoothness can nevertheless be well approximated by neural networks, if these networks are sufficiently deep. International audience
HAL Descartes; HAL-R... arrow_drop_down VBN; Aalborg University Research PortalArticle . 2022VBN; Aalborg University Research PortalResearch . 2019Constructive ApproximationArticle . 2021 . Peer-reviewedLicense: Springer Nature TDMData sources: CrossrefHal-DiderotArticle . 2021Full-Text: https://hal.inria.fr/hal-02117139v3/documentData sources: Hal-DiderotHal-DiderotConference object . 2019Full-Text: https://hal.inria.fr/hal-02127179/documentData sources: Hal-Diderothttps://doi.org/10.48550/arxiv...Article . 2019License: 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/s00365-021-09543-4&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.euAccess RoutesGreen bronze 30 citations 30 popularity Top 10% influence Top 10% impulse Top 10% Powered by BIP!more_vert HAL Descartes; HAL-R... arrow_drop_down VBN; Aalborg University Research PortalArticle . 2022VBN; Aalborg University Research PortalResearch . 2019Constructive ApproximationArticle . 2021 . Peer-reviewedLicense: Springer Nature TDMData sources: CrossrefHal-DiderotArticle . 2021Full-Text: https://hal.inria.fr/hal-02117139v3/documentData sources: Hal-DiderotHal-DiderotConference object . 2019Full-Text: https://hal.inria.fr/hal-02127179/documentData sources: Hal-Diderothttps://doi.org/10.48550/arxiv...Article . 2019License: 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/s00365-021-09543-4&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Conference object 2021 FrancePublisher:IEEE Funded by:NSF | SaTC: CORE: Medium: Colla..., ANR | TECAP, EC | CIRCUS +1 projectsNSF| SaTC: CORE: Medium: Collaborative: Automated Support for Writing High-Assurance Smart Contracts ,ANR| TECAP ,EC| CIRCUS ,FCT| HADESBarbosa, Manuel; Barthe, Gilles; Bhargavan, Karthik; Blanchet, Bruno; Cremers, Cas; Liao, Kevin; Parno, Bryan;International audience; Computer-aided cryptography is an active area of research that develops and applies formal, machine-checkable approaches to the design, analysis, and implementation of cryptography. We present a cross-cutting systematization of the computer-aided cryptography literature, focusing on three main areas: (i) design-level security (both symbolic security and computational security), (ii) functional correctness and efficiency, and (iii) implementation-level security (with a focus on digital side-channel resistance). In each area, we first clarify the role of computer-aided cryptography-how it can help and what the caveats are-in addressing current challenges. We next present a taxonomy of state-of-the-art tools, comparing their accuracy, scope, trustworthiness, and usability. Then, we highlight their main achievements, trade-offs, and research challenges. After covering the three main areas, we present two case studies. First, we study efforts in combining tools focused on different areas to consolidate the guarantees they can provide. Second, we distill the lessons learned from the computer-aided cryptography community's involvement in the TLS 1.3 standardization effort. Finally, we conclude with recommendations to paper authors, tool developers, and standardization bodies moving forward.
Hal-Diderot arrow_drop_down https://doi.org/10.1109/sp4000...Other literature type . Conference object . 2021 . Peer-reviewedLicense: https://doi.org/10.15223/policy-009add 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.1109/sp40001.2021.00008&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu19 citations 19 popularity Top 10% influence Average impulse Top 10% Powered by BIP!more_vert Hal-Diderot arrow_drop_down https://doi.org/10.1109/sp4000...Other literature type . Conference object . 2021 . Peer-reviewedLicense: https://doi.org/10.15223/policy-009add 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.1109/sp40001.2021.00008&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Conference object 2021Publisher:ACM Funded by:EC | CloudButtonEC| CloudButtonAuthors: Enes, Vitor; Baquero, Carlos; Gotsman, Alexey; Sutra, Pierre;Enes, Vitor; Baquero, Carlos; Gotsman, Alexey; Sutra, Pierre;International audience; Modern web applications replicate their data across the globe and require strong consistency guarantees for their most critical data. These guarantees are usually provided via state-machine replication (SMR). Recent advances in SMR have focused on leaderless protocols, which improve the availability and performance of traditional Paxos-based solutions. We propose Tempo - a leaderless SMR protocol that, in comparison to prior solutions, achieves superior throughput and offers predictable performance even in contended workloads. To achieve these benefits, Tempo timestamps each application command and executes it only after the timestamp becomes stable, i.e., all commands with a lower timestamp are known. Both the timestamping and stability detection mechanisms are fully decentralized, thus obviating the need for a leader replica. Our protocol furthermore generalizes to partial replication settings, enabling scalability in highly parallel workloads. We evaluate the protocol in both real and simulated geo-distributed environments and demonstrate that it outperforms state-of-the-art alternatives.
https://doi.org/10.1... arrow_drop_down https://doi.org/10.1145/344778...Other literature type . Conference object . 2021 . Peer-reviewedMémoires en Sciences de l'Information et de la CommunicationConference object . 2021add 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.1145/3447786.3456236&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu9 citations 9 popularity Top 10% influence Average impulse Top 10% Powered by BIP!more_vert https://doi.org/10.1... arrow_drop_down https://doi.org/10.1145/344778...Other literature type . Conference object . 2021 . Peer-reviewedMémoires en Sciences de l'Information et de la CommunicationConference object . 2021add 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.1145/3447786.3456236&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Conference object , Preprint , Article 2021 FrancePublisher:IEEE Funded by:EC | G-StatisticsEC| G-StatisticsAuthors: Guigui, Nicolas; Moceri, Pamela; Sermesant, Maxime; Pennec, Xavier;Guigui, Nicolas; Moceri, Pamela; Sermesant, Maxime; Pennec, Xavier;International audience; In cases of pressure or volume overload, probing cardiac function may be difficult because of the interactions between shape and deformations.In this work, we use the LDDMM framework and parallel transport to estimate and reorient deformations of the right ventricle. We then propose a normalization procedure for the amplitude of the deformation, and a second-order spline model to represent the full cardiac contraction. The method is applied to 3D meshes of the right ventricle extracted from echocardiographic sequences of 314 patients divided into three disease categories and a control group. We find significant differences between pathologies in the model parameters, revealing insights into the dynamics of each disease.
arXiv.org e-Print Ar... arrow_drop_down https://doi.org/10.1109/isbi48...Other literature type . Conference object . 2021 . Peer-reviewedLicense: IEEE CopyrightHal-DiderotConference object . 2021Full-Text: https://hal.inria.fr/hal-03142196/documentData sources: Hal-Diderothttps://doi.org/10.48550/arxiv...Article . 2021License: 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.1109/isbi48211.2021.9433887&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.euAccess RoutesGreen 2 citations 2 popularity Average influence Average impulse Average Powered by BIP!more_vert arXiv.org e-Print Ar... arrow_drop_down https://doi.org/10.1109/isbi48...Other literature type . Conference object . 2021 . Peer-reviewedLicense: IEEE CopyrightHal-DiderotConference object . 2021Full-Text: https://hal.inria.fr/hal-03142196/documentData sources: Hal-Diderothttps://doi.org/10.48550/arxiv...Article . 2021License: 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.1109/isbi48211.2021.9433887&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu
Loading
description Publicationkeyboard_double_arrow_right Conference object , Article 2021 FrancePublisher:ACM Funded by:EC | ParisRegionFPEC| ParisRegionFPMaximilian Böther; Leon Schiller; Philipp Fischbeck; Louise Molitor; Martin S. Krejca; Tobias Friedrich;International audience; Traffic congestion is a major issue that can be solved by suggesting drivers alternative routes they are willing to take. This concept has been formalized as a strategic routing problem in which a single alternative route is suggested to an existing one. We extend this formalization and introduce the Multiple-Routes problem, which is given a start and destination and aims at finding up to n different routes that the drivers strategically disperse over, minimizing the overall travel time of the system.Due to the NP-hard nature of the problem, we introduce the Multiple-Routes evolutionary algorithm (MREA) as a heuristic solver. We study several mutation and crossover operators and evaluate them on real-world data of Berlin, Germany. We find that a combination of all operators yields the best result, improving the overall travel time by a factor between 1.8 and 3, in the median, compared to all drivers taking the fastest route. For the base case n = 2, we compare our MREA to the highly tailored optimal solver by Bläsius et al. [ATMOS 2020] and show that, in the median, our approach finds solutions of quality at least 99.69 % of an optimal solution while only requiring 40 % of the time.
https://dl.acm.org/d... arrow_drop_down IEEE Transactions on Evolutionary ComputationArticle . 2023 . Peer-reviewedLicense: IEEE CopyrightData sources: CrossrefMémoires en Sciences de l'Information et de la CommunicationConference object . 2021Full-Text: https://hal.science/hal-03201943/documentMémoires en Sciences de l'Information et de la CommunicationArticle . 2022Full-Text: https://hal.science/hal-03904251/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.1145/3449639.3459307&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.euAccess Routesbronze 2 citations 2 popularity Average influence Average impulse Average Powered by BIP!more_vert https://dl.acm.org/d... arrow_drop_down IEEE Transactions on Evolutionary ComputationArticle . 2023 . Peer-reviewedLicense: IEEE CopyrightData sources: CrossrefMémoires en Sciences de l'Information et de la CommunicationConference object . 2021Full-Text: https://hal.science/hal-03201943/documentMémoires en Sciences de l'Information et de la CommunicationArticle . 2022Full-Text: https://hal.science/hal-03904251/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.1145/3449639.3459307&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Article , Preprint , Conference object 2021 FrancePublisher:ACM Funded by:EC | VeriDreamEC| VeriDreamAuthors: Achkan, Salehi; Coninx, Alexandre; Doncieux, Stephane;Achkan, Salehi; Coninx, Alexandre; Doncieux, Stephane;As open-ended learning based on divergent search algorithms such as Novelty Search (NS) draws more and more attention from the research community, it is natural to expect that its application to increasingly complex real-world problems will require the exploration to operate in higher dimensional Behavior Spaces which will not necessarily be Euclidean. Novelty Search traditionally relies on k-nearest neighbours search and an archive of previously visited behavior descriptors which are assumed to live in a Euclidean space. This is problematic because of a number of issues. On one hand, Euclidean distance and Nearest-neighbour search are known to behave differently and become less meaningful in high dimensional spaces. On the other hand, the archive has to be bounded since, memory considerations aside, the computational complexity of finding nearest neighbours in that archive grows linearithmically with its size. A sub-optimal bound can result in "cycling" in the behavior space, which inhibits the progress of the exploration. Furthermore, the performance of NS depends on a number of algorithmic choices and hyperparameters, such as the strategies to add or remove elements to the archive and the number of neighbours to use in k-nn search. In this paper, we discuss an alternative approach to novelty estimation, dubbed Behavior Recognition based Novelty Search (BR-NS), which does not require an archive, makes no assumption on the metrics that can be defined in the behavior space and does not rely on nearest neighbours search. We conduct experiments to gain insight into its feasibility and dynamics as well as potential advantages over archive-based NS in terms of time complexity. Comment: Author version of the paper accepted at GECCO 21
arXiv.org e-Print Ar... arrow_drop_down https://doi.org/10.48550/arxiv...Article . 2021License: arXiv Non-Exclusive DistributionData sources: DataciteMémoires en Sciences de l'Information et de la CommunicationConference object . 2021https://doi.org/10.1145/344963...Other literature type . Conference object . 2021 . Peer-reviewedadd 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.1145/3449639.3459303&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.euAccess RoutesGreen 3 citations 3 popularity Top 10% influence Average impulse Average Powered by BIP!more_vert arXiv.org e-Print Ar... arrow_drop_down https://doi.org/10.48550/arxiv...Article . 2021License: arXiv Non-Exclusive DistributionData sources: DataciteMémoires en Sciences de l'Information et de la CommunicationConference object . 2021https://doi.org/10.1145/344963...Other literature type . Conference object . 2021 . Peer-reviewedadd 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.1145/3449639.3459303&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Conference object 2021 FrancePublisher:ACM Funded by:EC | ForM-SMArtEC| ForM-SMArtAli Asadi; Krishnendu Chatterjee; Hongfei Fu; Amir Kafshdar Goharshady; Mohammad Mahdavi;International audience; We consider the fundamental problem of reachability analysis over imperative programs with real variables. Previous works that tackle reachability are either unable to handle programs consisting of general loops (e.g. symbolic execution), or lack completeness guarantees (e.g. abstract interpretation), or are not automated (e.g. incorrectness logic). In contrast, we propose a novel approach for reachability analysis that can handle general and complex loops, is complete, and can be entirely automated for a wide family of programs. Through the notion of Inductive Reachability Witnesses (IRWs), our approach extends ideas from both invariant generation and termination to reachability analysis. We first show that our IRW-based approach is sound and complete for reachability analysis of imperative programs. Then, we focus on linear and polynomial programs and develop automated methods for synthesizing linear and polynomial IRWs. In the linear case, we follow the well-known approaches using Farkas' Lemma. Our main contribution is in the polynomial case, where we present a pushbutton semicomplete algorithm. We achieve this using a novel combination of classical theorems in real algebraic geometry, such as Putinar's Positivstellensatz and Hilbert's Strong Nullstellensatz. Finally, our experimental results show we can prove complex reachability objectives over various benchmarks that were beyond the reach of previous methods.
https://hal.archives... arrow_drop_down Mémoires en Sciences de l'Information et de la CommunicationConference object . 2021Full-Text: https://hal.science/hal-03183862/documenthttps://doi.org/10.1145/345348...Conference object . 2021 . Peer-reviewedadd 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.1145/3453483.3454076&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu9 citations 9 popularity Top 10% influence Average impulse Top 10% Powered by BIP!more_vert https://hal.archives... arrow_drop_down Mémoires en Sciences de l'Information et de la CommunicationConference object . 2021Full-Text: https://hal.science/hal-03183862/documenthttps://doi.org/10.1145/345348...Conference object . 2021 . Peer-reviewedadd 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.1145/3453483.3454076&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Conference object , Preprint , Article 2021 FrancePublisher:ACM Funded by:EC | IDEAA, EC | BigFastDataEC| IDEAA ,EC| BigFastDataAuthors: Diao, Yanlei; Guzewicz, Pawel; Manolescu, Ioana; Mazuran, Mirjana;Diao, Yanlei; Guzewicz, Pawel; Manolescu, Ioana; Mazuran, Mirjana;As large Open Data are increasingly shared as RDF graphs today, there is a growing demand to help users discover the most interesting facets of a graph, which are often hard to grasp without automatic tools. We consider the problem of automatically identifying the k most interesting aggregate queries that can be evaluated on an RDF graph, given an integer k and a user-specified interestingness function. Our problem departs from analytics in relational data warehouses in that (i) in an RDF graph we are not given but we must identify the facts, dimensions, and measures of candidate aggregates; (ii) the classical approach to efficiently evaluating multiple aggregates breaks in the face of multi-valued dimensions in RDF data. In this work, we propose an extensible end-to-end framework that enables the identification and evaluation of interesting aggregates based on a new RDF-compatible one-pass algorithm for efficiently evaluating a lattice of aggregates and a novel early-stop technique (with probabilistic guarantees) that can prune uninteresting aggregates. Experiments using both real and synthetic graphs demonstrate the ability of our framework to find interesting aggregates in a large search space, the efficiency of our algorithms (with up to 2.9x speedup over a similar pipeline based on existing algorithms), and scalability as the data size and complexity grow. Comment: Accepted for publication in proceedings of the 2021 International Conference on Management of Data (SIGMOD '21), June 20--25, 2021, Virtual Event, China
http://arxiv.org/pdf... arrow_drop_down Hal-DiderotConference object . 2021Full-Text: https://hal.inria.fr/hal-03320929/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.1145/3448016.3457307&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.euAccess RoutesGreen 3 citations 3 popularity Top 10% influence Average impulse Average Powered by BIP!more_vert http://arxiv.org/pdf... arrow_drop_down Hal-DiderotConference object . 2021Full-Text: https://hal.inria.fr/hal-03320929/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.1145/3448016.3457307&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Conference object , Article , Preprint 2021 FrancePublisher:IEEE Funded by:EC | MIP-FrontiersEC| MIP-FrontiersAuthors: Cífka, Ondřej; Ozerov, Alexey; Şimşekli, Umut; Richard, Gael;Cífka, Ondřej; Ozerov, Alexey; Şimşekli, Umut; Richard, Gael;Neural style transfer, allowing to apply the artistic style of one image to another, has become one of the most widely showcased computer vision applications shortly after its introduction. In contrast, related tasks in the music audio domain remained, until recently, largely untackled. While several style conversion methods tailored to musical signals have been proposed, most lack the 'one-shot' capability of classical image style transfer algorithms. On the other hand, the results of existing one-shot audio style transfer methods on musical inputs are not as compelling. In this work, we are specifically interested in the problem of one-shot timbre transfer. We present a novel method for this task, based on an extension of the vector-quantized variational autoencoder (VQ-VAE), along with a simple self-supervised learning strategy designed to obtain disentangled representations of timbre and pitch. We evaluate the method using a set of objective metrics and show that it is able to outperform selected baselines. Comment: ICASSP 2021. Website: https://adasp.telecom-paris.fr/s/ss-vq-vae
https://hal.telecom-... arrow_drop_down https://doi.org/10.1109/icassp...Other literature type . Conference object . 2021 . Peer-reviewedLicense: IEEE Copyrighthttps://doi.org/10.48550/arxiv...Article . 2021License: 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.1109/icassp39728.2021.9414235&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.euAccess RoutesGreen 1 citations 1 popularity Average influence Average impulse Average Powered by BIP!more_vert https://hal.telecom-... arrow_drop_down https://doi.org/10.1109/icassp...Other literature type . Conference object . 2021 . Peer-reviewedLicense: IEEE Copyrighthttps://doi.org/10.48550/arxiv...Article . 2021License: 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.1109/icassp39728.2021.9414235&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Conference object 2021 FrancePublisher:IEEE Publicly fundedFunded by:EC | RealVisionEC| RealVisionAk, Ali; Zerman, Emin; Ling, Suiyi; Le Callet, Patrick; Smolic, Aljosa;Volumetric video content has attracted increasing research interests over the last decade, as it facilitates the integration of dynamic real world content in virtual environments. Point cloud is one of the most common alternatives to represent volumetric video content. Yet, such representation requires an enormous data storage and pose significant greater pressures on compression algorithms compared to the standard 2D video. This challenge has unleashed a new wave in the development of novel point cloud compression technologies, which need to be evaluated in terms of production quality. Due to the high dimensionality of the data, evaluating the performances of relevant coding algorithms can be time consuming. This puts a barrier on optimizing coding algorithms with complex, but perceptually accurate, objective quality metrics. In this study, we thus explore the possibility of reducing temporal-dimension of the content under-evaluation, i.e., temporal sub-sampling, for objective quality evaluation without sacrificing from the correlation with the subjective opinion. In addition, we exploit different temporal pooling methods to further make the quality evaluation procedure more efficient. In total 30 different objective quality metrics were tested on the the V-SENSE volumetric video quality database. According to experimental results, there is no need to employ full frame-rate (30 fps) assessment to reach the meaningful correlation for the considered quality metrics. These observations could be referred to reduce the computation complexity regarding the evaluation and optimization of the relevant compression algorithms.
https://hal.archives... arrow_drop_down https://doi.org/10.1109/pcs508...Other literature type . Conference object . 2021 . Peer-reviewedLicense: STM Policy #29Mémoires en Sciences de l'Information et de la CommunicationConference object . 2021Full-Text: https://hal.science/hal-03206240/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.1109/pcs50896.2021.9477449&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu1 citations 1 popularity Average influence Average impulse Average Powered by BIP!more_vert https://hal.archives... arrow_drop_down https://doi.org/10.1109/pcs508...Other literature type . Conference object . 2021 . Peer-reviewedLicense: STM Policy #29Mémoires en Sciences de l'Information et de la CommunicationConference object . 2021Full-Text: https://hal.science/hal-03206240/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.1109/pcs50896.2021.9477449&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Article , Conference object , Research , Preprint 2021 France, Denmark, DenmarkPublisher:Springer Science and Business Media LLC Funded by:EC | DEDALEEC| DEDALEAuthors: Gribonval, Rémi; Kutyniok, Gitta; Nielsen, Morten; Voigtlaender, Felix;Gribonval, Rémi; Kutyniok, Gitta; Nielsen, Morten; Voigtlaender, Felix;We study the expressivity of deep neural networks. Measuring a network's complexity by its number of connections or by its number of neurons, we consider the class of functions for which the error of best approximation with networks of a given complexity decays at a certain rate when increasing the complexity budget. Using results from classical approximation theory, we show that this class can be endowed with a (quasi)-norm that makes it a linear function space, called approximation space. We establish that allowing the networks to have certain types of "skip connections" does not change the resulting approximation spaces. We also discuss the role of the network's nonlinearity (also known as activation function) on the resulting spaces, as well as the role of depth. For the popular ReLU nonlinearity and its powers, we relate the newly constructed spaces to classical Besov spaces. The established embeddings highlight that some functions of very low Besov smoothness can nevertheless be well approximated by neural networks, if these networks are sufficiently deep. International audience
HAL Descartes; HAL-R... arrow_drop_down VBN; Aalborg University Research PortalArticle . 2022VBN; Aalborg University Research PortalResearch . 2019Constructive ApproximationArticle . 2021 . Peer-reviewedLicense: Springer Nature TDMData sources: CrossrefHal-DiderotArticle . 2021Full-Text: https://hal.inria.fr/hal-02117139v3/documentData sources: Hal-DiderotHal-DiderotConference object . 2019Full-Text: https://hal.inria.fr/hal-02127179/documentData sources: Hal-Diderothttps://doi.org/10.48550/arxiv...Article . 2019License: 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/s00365-021-09543-4&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.euAccess RoutesGreen bronze 30 citations 30 popularity Top 10% influence Top 10% impulse Top 10% Powered by BIP!more_vert HAL Descartes; HAL-R... arrow_drop_down VBN; Aalborg University Research PortalArticle . 2022VBN; Aalborg University Research PortalResearch . 2019Constructive ApproximationArticle . 2021 . Peer-reviewedLicense: Springer Nature TDMData sources: CrossrefHal-DiderotArticle . 2021Full-Text: https://hal.inria.fr/hal-02117139v3/documentData sources: Hal-DiderotHal-DiderotConference object . 2019Full-Text: https://hal.inria.fr/hal-02127179/documentData sources: Hal-Diderothttps://doi.org/10.48550/arxiv...Article . 2019License: 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/s00365-021-09543-4&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Conference object 2021 FrancePublisher:IEEE Funded by:NSF | SaTC: CORE: Medium: Colla..., ANR | TECAP, EC | CIRCUS +1 projectsNSF| SaTC: CORE: Medium: Collaborative: Automated Support for Writing High-Assurance Smart Contracts ,ANR| TECAP ,EC| CIRCUS ,FCT| HADESBarbosa, Manuel; Barthe, Gilles; Bhargavan, Karthik; Blanchet, Bruno; Cremers, Cas; Liao, Kevin; Parno, Bryan;International audience; Computer-aided cryptography is an active area of research that develops and applies formal, machine-checkable approaches to the design, analysis, and implementation of cryptography. We present a cross-cutting systematization of the computer-aided cryptography literature, focusing on three main areas: (i) design-level security (both symbolic security and computational security), (ii) functional correctness and efficiency, and (iii) implementation-level security (with a focus on digital side-channel resistance). In each area, we first clarify the role of computer-aided cryptography-how it can help and what the caveats are-in addressing current challenges. We next present a taxonomy of state-of-the-art tools, comparing their accuracy, scope, trustworthiness, and usability. Then, we highlight their main achievements, trade-offs, and research challenges. After covering the three main areas, we present two case studies. First, we study efforts in combining tools focused on different areas to consolidate the guarantees they can provide. Second, we distill the lessons learned from the computer-aided cryptography community's involvement in the TLS 1.3 standardization effort. Finally, we conclude with recommendations to paper authors, tool developers, and standardization bodies moving forward.
Hal-Diderot arrow_drop_down https://doi.org/10.1109/sp4000...Other literature type . Conference object . 2021 . Peer-reviewedLicense: https://doi.org/10.15223/policy-009add 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.1109/sp40001.2021.00008&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu19 citations 19 popularity Top 10% influence Average impulse Top 10% Powered by BIP!more_vert Hal-Diderot arrow_drop_down https://doi.org/10.1109/sp4000...Other literature type . Conference object . 2021 . Peer-reviewedLicense: https://doi.org/10.15223/policy-009add 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.1109/sp40001.2021.00008&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Conference object 2021Publisher:ACM Funded by:EC | CloudButtonEC| CloudButtonAuthors: Enes, Vitor; Baquero, Carlos; Gotsman, Alexey; Sutra, Pierre;Enes, Vitor; Baquero, Carlos; Gotsman, Alexey; Sutra, Pierre;International audience; Modern web applications replicate their data across the globe and require strong consistency guarantees for their most critical data. These guarantees are usually provided via state-machine replication (SMR). Recent advances in SMR have focused on leaderless protocols, which improve the availability and performance of traditional Paxos-based solutions. We propose Tempo - a leaderless SMR protocol that, in comparison to prior solutions, achieves superior throughput and offers predictable performance even in contended workloads. To achieve these benefits, Tempo timestamps each application command and executes it only after the timestamp becomes stable, i.e., all commands with a lower timestamp are known. Both the timestamping and stability detection mechanisms are fully decentralized, thus obviating the need for a leader replica. Our protocol furthermore generalizes to partial replication settings, enabling scalability in highly parallel workloads. We evaluate the protocol in both real and simulated geo-distributed environments and demonstrate that it outperforms state-of-the-art alternatives.
https://doi.org/10.1... arrow_drop_down https://doi.org/10.1145/344778...Other literature type . Conference object . 2021 . Peer-reviewedMémoires en Sciences de l'Information et de la CommunicationConference object . 2021add 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.1145/3447786.3456236&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu9 citations 9 popularity Top 10% influence Average impulse Top 10% Powered by BIP!more_vert https://doi.org/10.1... arrow_drop_down https://doi.org/10.1145/344778...Other literature type . Conference object . 2021 . Peer-reviewedMémoires en Sciences de l'Information et de la CommunicationConference object . 2021add 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.1145/3447786.3456236&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Conference object , Preprint , Article 2021 FrancePublisher:IEEE Funded by:EC | G-StatisticsEC| G-StatisticsAuthors: Guigui, Nicolas; Moceri, Pamela; Sermesant, Maxime; Pennec, Xavier;Guigui, Nicolas; Moceri, Pamela; Sermesant, Maxime; Pennec, Xavier;International audience; In cases of pressure or volume overload, probing cardiac function may be difficult because of the interactions between shape and deformations.In this work, we use the LDDMM framework and parallel transport to estimate and reorient deformations of the right ventricle. We then propose a normalization procedure for the amplitude of the deformation, and a second-order spline model to represent the full cardiac contraction. The method is applied to 3D meshes of the right ventricle extracted from echocardiographic sequences of 314 patients divided into three disease categories and a control group. We find significant differences between pathologies in the model parameters, revealing insights into the dynamics of each disease.
arXiv.org e-Print Ar... arrow_drop_down https://doi.org/10.1109/isbi48...Other literature type . Conference object . 2021 . Peer-reviewedLicense: IEEE CopyrightHal-DiderotConference object . 2021Full-Text: https://hal.inria.fr/hal-03142196/documentData sources: Hal-Diderothttps://doi.org/10.48550/arxiv...Article . 2021License: 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.1109/isbi48211.2021.9433887&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.euAccess RoutesGreen 2 citations 2 popularity Average influence Average impulse Average Powered by BIP!more_vert arXiv.org e-Print Ar... arrow_drop_down https://doi.org/10.1109/isbi48...Other literature type . Conference object . 2021 . Peer-reviewedLicense: IEEE CopyrightHal-DiderotConference object . 2021Full-Text: https://hal.inria.fr/hal-03142196/documentData sources: Hal-Diderothttps://doi.org/10.48550/arxiv...Article . 2021License: 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.1109/isbi48211.2021.9433887&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu