Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 334 matches
- 2024
- Giuseppe Stracquadanio, Sourav Medya, Stefano Quer, Debjit Pal:
VeriBug: An Attention-Based Framework for Bug Localization in Hardware Designs. DATE 2024: 1-2 - Leandro Antonelli, Hassan Badir, Houssam Bazza, Sandro Bimonte, Stefano Rizzi:
Requirements Engineering for Continuous Queries on IoRT Data: A Case Study in Agricultural Autonomous Robots Monitoring. ICEIS (2) 2024: 113-120 - Maria Pegia, Ferran Agullo Lopez, Anastasia Moumtzidou, Alberto Gutierrez-Torre, Björn Þór Jónsson, Josep Lluis Berral-Garcia, Ilias Gialampoukidis, Stefanos Vrochidis, Ioannis Kompatsiaris:
Time-Quality Tradeoff of MuseHash Query Processing Performance. MMM (3) 2024: 270-283 - Giuseppe Stracquadanio, Sourav Medya, Stefano Quer, Debjit Pal:
VeriBug: An Attention-based Framework for Bug-Localization in Hardware Designs. CoRR abs/2401.09494 (2024) - Stefano M. Nicoletti, Milan Lopuhaä-Zwakenberg, Ernst Moritz Hahn, Mariëlle Stoelinga:
Querying Fault and Attack Trees: Property Specification on a Water Network. CoRR abs/2401.16015 (2024) - Pei Wang, Zhaowei Cai, Hao Yang, Ashwin Swaminathan, R. Manmatha, Stefano Soatto:
Mixed-Query Transformer: A Unified Image Segmentation Architecture. CoRR abs/2404.04469 (2024) - 2023
- Francesco Angione, Davide Appello, Paolo Bernardi, Andrea Calabrese, Stefano Quer, Matteo Sonza Reorda, Vincenzo Tancorre, Roberto Ugioli:
A Toolchain to Quantify Burn-In Stress Effectiveness on Large Automotive System-on-Chips. IEEE Access 11: 105655-105676 (2023) - Alessandro Borione, Lorenzo Cardone, Andrea Calabrese, Stefano Quer:
An Experimental Evaluation of Graph Coloring Heuristics on Multi- and Many-Core Architectures. IEEE Access 11: 125226-125243 (2023) - Jevgenij Krivochiza, Juan Carlos Merlano Duncan, Jorge Querol, Nicola Maturo, Liz Martinez Marrero, Stefano Andrenacci, Jens Krause, Symeon Chatzinotas:
End-to-End Precoding Validation Over a Live GEO Satellite Forward Link. IEEE Access 11: 41556-41564 (2023) - Luciano Gualà, Stefano Leucci, Isabella Ziccardi:
Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees. Algorithmica 85(6): 1624-1651 (2023) - Giovanni Bocchi, Stefano Botteghi, Martina Brasini, Patrizio Frosini, Nicola Quercioli:
On the finite representation of linear group equivariant operators via permutant measures. Ann. Math. Artif. Intell. 91(4): 465-487 (2023) - Sabrina De Capitani di Vimercati, Sara Foresti, Sushil Jajodia, Giovanni Livraga, Stefano Paraboschi, Pierangela Samarati:
Distributed query execution under access restrictions. Comput. Secur. 127: 103056 (2023) - Lorenzo Cardone, Stefano Quer:
The Multi-Maximum and Quasi-Maximum Common Subgraph Problem. Comput. 11(4): 69 (2023) - Evangelos A. Stathopoulos, Anastasios I. Karageorgiadis, Alexandros Kokkalas, Sotiris Diplaris, Stefanos Vrochidis, Ioannis Kompatsiaris:
A Query Expansion Benchmark on Social Media Information Retrieval: Which Methodology Performs Best and Aligns with Semantics? Comput. 12(6): 119 (2023) - Mirko Zichichi, Luca Serena, Stefano Ferretti, Gabriele D'Angelo:
Complex queries over decentralised systems for geodata retrieval. IET Networks 12(2): 37-52 (2023) - Eirini Molla, Panagiotis Rizomiliotis, Stefanos Gritzalis:
Efficient searchable symmetric encryption supporting range queries. Int. J. Inf. Sec. 22(4): 785-798 (2023) - Federico Igne, Stefano Germano, Ian Horrocks:
Conjunctive query answering over unrestricted OWL 2 ontologies. Semantic Web 14(6): 997-1050 (2023) - Matteo Orlando, Lorenzo Bottaccioli, Stefano Quer, Massimo Poncino, Sara Vinco, Edoardo Patti:
A Framework for Economic and Environmental Benefit Through Renewable Energy Community. IEEE Syst. J. 17(4): 5626-5635 (2023) - Marco Castangia, Nicola Barletta, Christian Camarda, Stefano Quer, Enrico Macii, Edoardo Patti:
Clustering Appliance Operation Modes With Unsupervised Deep Learning Techniques. IEEE Trans. Ind. Informatics 19(7): 8196-8204 (2023) - Matteo Francia, Matteo Golfarelli, Patrick Marcel, Stefano Rizzi, Panos Vassiliadis:
Suggesting Assess Queries for Interactive Analysis of Multidimensional Data. IEEE Trans. Knowl. Data Eng. 35(6): 6421-6434 (2023) - Sandro Bimonte, Patrick Marcel, Stefano Rizzi:
Be High on Emotion: Coping with Emotions and Emotional Intelligence when Querying Data. ADBIS (Short Papers) 2023: 82-91 - Ashrujit Ghoshal, Stefano Tessaro:
The Query-Complexity of Preprocessing Attacks. CRYPTO (2) 2023: 482-513 - Guglielmo Faggioli, Thibault Formal, Stefano Marchesin, Stéphane Clinchant, Nicola Ferro, Benjamin Piwowarski:
Query Performance Prediction for Neural IR: Are We There Yet? ECIR (1) 2023: 232-248 - Loredana Caruccio, Stefano Cirillo, Vincenzo Deufemia, Giuseppe Polese, Roberto Stanzione:
REQUIRED: A Tool to Relax Queries through Relaxed Functional Dependencies. EDBT 2023: 823-826 - Caz Saaltink, Stefano M. Nicoletti, Matthias Volk, Ernst Moritz Hahn, Mariëlle Stoelinga:
Solving Queries for Boolean Fault Tree Logic via Quantified SAT. FTSCS 2023: 48-59 - Andrea Calabrese, Lorenzo Cardone, Salvatore Licata, Marco Porro, Stefano Quer:
A Web Scraping Algorithm to Improve the Computation of the Maximum Common Subgraph. ICSOFT 2023: 197-206 - Guglielmo Faggioli, Thibault Formal, Simon Lupart, Stefano Marchesin, Stéphane Clinchant, Nicola Ferro, Benjamin Piwowarski:
Towards Query Performance Prediction for Neural Information Retrieval: Challenges and Opportunities. ICTIR 2023: 51-63 - Guglielmo Faggioli, Thibault Formal, Stefano Marchesin, Stéphane Clinchant, Nicola Ferro, Benjamin Piwowarski:
On the Limitations of Query Performance Prediction for Neural IR. SEBD 2023: 379-390 - Zineb Smine, Paolo Melidoro, Ahmed Qureshi, Stefano Longobardi, Steven E. Williams, Oleg V. Aslanidi, Adelaide de Vecchi:
Global Sensitivity Analysis of Thrombus Formation in the Left Atrial Appendage of Atrial Fibrillation Patients. STACOM@MICCAI 2023: 55-65 - Guglielmo Faggioli, Thibault Formal, Stefano Marchesin, Stéphane Clinchant, Nicola Ferro, Benjamin Piwowarski:
Query Performance Prediction for Neural IR: Are We There Yet? CoRR abs/2302.09947 (2023)
skipping 304 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-06-25 00:33 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint