Výsledky vyhledávání - "ROSSANO VENTURINI"

Adaptive learning of compressible strings

Autor: Rossano Venturini, Gabriele Fici, Nicola Prezza

Publikováno v: Theoretical Computer Science. 896:46-52

Suppose an oracle knows a string $S$ that is unknown to us and that we want to determine. The oracle can answer queries of the form "Is $s$ a substring of $S$?". In 1995, Skiena and Sundaram showed that, in the worst case, any algorithm needs to ask

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::78b097f778dcdecec8491ad9c9ec0847
https://doi.org/10.1016/j.tcs.2021.10.003

Zobrazit plný text záznamu

An Optimal Algorithm for Finding Champions in Tournament Graphs

Autor: Lorenzo Beretta, Franco Maria Nardini, Roberto Trani, Rossano Venturini

A tournament graph is a complete directed graph, which can be used to model a round-robin tournament between $n$ players. In this paper, we address the problem of finding a champion of the tournament, also known as Copeland winner, which is a player

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::55f5775c48a3ec0c61d36e125e562d79
http://arxiv.org/abs/2111.13621

Zobrazit plný text záznamu

Elektronická kniha

String Processing and Information Retrieval : 30th International Symposium, SPIRE 2023, Pisa, Italy, September 26–28, 2023, Proceedings

Autor: Franco Maria Nardini, Nadia Pisanti, Rossano Venturini

This volume LNCS 14240 constitutes the refereed proceedings of the 30th International Symposium on String Processing and Information Retrieval, SPIRE 2023, held in Pisa, Italy, during September 26–28, 2023. The 31 full papers presented were care

Zobrazit plný text záznamu

TSXor: a simple time series compression algorithm

Autor: Franco Maria Nardini, Rossano Venturini, Andrea Bruno, Giulio Ermanno Pibiri, Roberto Trani

Publikováno v: SPIRE 2021-International Symposium on String Processing and Information Retrieval, pp. 217–223, France, Lille (Virtual Event), 04/10/2021-06/10/2021
info:cnr-pdr/source/autori:Bruno A.; Nardini F.M.; Pibiri G.E.; Trani R.; Venturini R./congresso_nome:SPIRE 2021-International Symposium on String Processing and Information Retrieval/congresso_luogo:France, Lille (Virtual Event)/congresso_data:04%2F10%2F2021-06%2F10%2F2021/anno:2021/pagina_da:217/pagina_a:223/intervallo_pagine:217–223
String Processing and Information Retrieval ISBN: 9783030866914
SPIRE

Time series are ubiquitous in computing as a key ingredient of many machine learning analytics, ranging from classification to forecasting. Typically, the training of such machine learning algorithms on time series requires to access the data in temp

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7dd124f8aefbc4f36a70700ae33d6885
https://publications.cnr.it/doc/457237

Zobrazit plný text záznamu

Fast filtering of search results sorted by attribute

Autor: Roberto Trani, Franco Maria Nardini, Rossano Venturini

Publikováno v: ACM transactions on information systems 40 (2021). doi:10.1145/3477982
info:cnr-pdr/source/autori:Nardini F.M.; Trani R.; Venturini R./titolo:Fast filtering of search results sorted by attribute/doi:10.1145%2F3477982/rivista:ACM transactions on information systems/anno:2021/pagina_da:/pagina_a:/intervallo_pagine:/volume:40

Modern search services often provide multiple options to rank the search results, e.g., sort “by relevance”, “by price” or “by discount” in e-commerce. While the traditional rank by relevance effectively places the relevant results in the

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8b35010403e7b4102853e42ce91a27ef
https://openportal.isti.cnr.it/doc?id=people______::5535ab144c7739c51e9b47a02dead1e9

Zobrazit plný text záznamu

Compressed indexes for fast search of semantic data (extended abstract)

Autor: Giulio Ermanno Pibiri, Rossano Venturini, Raffaele Perego

Publikováno v: ICDE

The sheer increase in volume of RDF data demands efficient solutions for the triple indexing problem, that is devising a compressed data structure to compactly represent RDF triples by guaranteeing, at the same time, fast pattern matching operations.

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::01a12d7d356ff58865647cdd65c3ec49
https://hdl.handle.net/10278/5009277

Zobrazit plný text záznamu

Method to rank documents by a computer, using additive ensembles of regression trees and cache optimisation, and search engine using such a method

Autor: Domenico, Dato, Lucchese, Claudio, Franco Maria NARDINI, Orlando, Salvatore, Raffaele, Perego, Nicola, Tonellotto, Rossano, Venturini

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od______3655::726a352c9d74e8deb41e0dd6aad8e33f
http://hdl.handle.net/10278/3745892

Zobrazit plný text záznamu

BigDataGrapes D3.3 - Distributed Indexing Components

Autor: Rossano Venturini, Giulio Ermanno Pibiri, Raffaele Perego

The BigDataGrapes (BDG) platform aspires to provide components that go beyond the state-of-the-art on various stages of the management, processing, and usage of grapevine-related big data assets thus making easier for grapevine-powered industries to

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::45496cba495f71bc7b2e561b5f78449e

Zobrazit plný text záznamu

Techniques for inverted index compression

Autor: Rossano Venturini, Giulio Ermanno Pibiri

Publikováno v: ACM computing surveys 53 (2020). doi:10.1145/3415148
info:cnr-pdr/source/autori:Pibiri G.E.; Venturini R./titolo:Techniques for Inverted Index Compression/doi:10.1145%2F3415148/rivista:ACM computing surveys/anno:2020/pagina_da:/pagina_a:/intervallo_pagine:/volume:53
ACM Computing Surveys

The data structure at the core of large-scale search engines is the inverted index, which is essentially a collection of sorted integer sequences called inverted lists. Because of the many documents indexed by such engines and stringent performance r

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::02562188bdd4198970fe0427cf3f5e01
https://openportal.isti.cnr.it/doc?id=people______::e7a0dbdd84e2cd9964802588b8aac502

Zobrazit plný text záznamu

Practical trade-offs for the prefix-sum problem

Autor: Giulio Ermanno Pibiri, Rossano Venturini

Publikováno v: Software, practice & experience
(2020). doi:10.1002/spe.2918
Software: Practice and Experience
info:cnr-pdr/source/autori:Pibiri G.E.; Venturini R./titolo:Practical trade-offs for the prefix-sum problem/doi:10.1002%2Fspe.2918/rivista:Software, practice & experience (Print)/anno:2020/pagina_da:/pagina_a:/intervallo_pagine:/volume

Given an integer array A, the prefix-sum problem is to answer sum(i) queries that return the sum of the elements in A[0..i], knowing that the integers in A can be changed. It is a classic problem in data structure design with a wide range of applicat

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b9e736f35d4cfdf069ad867d26a99030
https://openportal.isti.cnr.it/doc?id=people______::51c2b881858260bb5d3d2b00fda2bf02

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání