Folgen
Salvatore Orlando
Salvatore Orlando
Professor of Computer Science, Università Ca' Foscari Venezia, Italy
Bestätigte E-Mail-Adresse bei unive.it - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Fast and memory efficient mining of frequent closed itemsets
C Lucchese, S Orlando, R Perego
IEEE Transactions on Knowledge and Data Engineering 18 (1), 21-36, 2005
3272005
P3 L: A structured high‐level parallel language, and its structured support
B Bacci, M Danelutto, S Orlando, S Pelagatti, M Vanneschi
Concurrency: practice and experience 7 (3), 225-255, 1995
3111995
Boosting the performance of web search engines: Caching and prefetching query results by exploiting historical usage data
T Fagni, R Perego, F Silvestri, S Orlando
ACM Transactions on Information Systems (TOIS) 24 (1), 51-78, 2006
2852006
Enhancing the Apriori Algorithm for Frequent Set Counting
R Perego, S Orlando, P Palmerini
international conference on data warehousing and knowledge discovery, 71-82, 2001
1992001
Identifying task-based sessions in search engine query logs
C Lucchese, S Orlando, R Perego, F Silvestri, G Tolomei
Proceedings of the fourth ACM international conference on Web search and …, 2011
1852011
Adaptive and resource-aware mining of frequent sets
S Orlando, P Palmerini, R Perego, F Silvestri
2002 IEEE International Conference on Data Mining, 2002. Proceedings., 338-345, 2002
1542002
A methodology for the development and the support of massively parallel programs
M Danelutto, R Di Meglio, S Orlando, S Pelagatti, M Vanneschi
Future Generation Computer Systems 8 (1-3), 205-220, 1992
1471992
Fast ranking with additive ensembles of oblivious and non-oblivious regression trees
D Dato, C Lucchese, FM Nardini, S Orlando, R Perego, N Tonellotto, ...
ACM Transactions on Information Systems (TOIS) 35 (2), 1-31, 2016
1252016
Learning relatedness measures for entity linking
D Ceccarelli, C Lucchese, S Orlando, R Perego, S Trani
Proceedings of the 22nd ACM international conference on Information …, 2013
1202013
Trajectory data warehouses: Design and implementation issues
S Orlando, R Orsini, A Raffaetà, A Roncato, C Silvestri
Journal of computing science and engineering 1 (2), 211-232, 2007
1012007
Quickscorer: A fast algorithm to rank documents with additive ensembles of regression trees
C Lucchese, FM Nardini, S Orlando, R Perego, N Tonellotto, R Venturini
Proceedings of the 38th International ACM SIGIR Conference on Research and …, 2015
1002015
DCI Closed: A Fast and Memory Efficient Algorithm to Mine Frequent Closed Itemsets.
C Lucchese, S Orlando, R Perego
Fimi, 2004
1002004
Dexter: an open source framework for entity linking
D Ceccarelli, C Lucchese, S Orlando, R Perego, S Trani
Proceedings of the sixth international workshop on Exploiting semantic …, 2013
992013
kDCI: a multi-strategy algorithm for mining frequent sets
S Orlando, C Lucchese, P Palmerini, R Perego, F Silvestri
IEEE ICDM’03 Workshop FIMI’03, 2003
91*2003
A Unifying Framework for Mining Approximate Top-Binary Patterns
C Lucchese, S Orlando, R Perego
IEEE Transactions on Knowledge and Data Engineering 26 (12), 2900-2913, 2013
892013
A new algorithm for gap constrained sequence mining
S Orlando, R Perego, C Silvestri
Proceedings of the 2004 ACM symposium on Applied computing, 540-547, 2004
842004
Mining top-k patterns from binary datasets in presence of noise
C Lucchese, S Orlando, R Perego
Proceedings of the 2010 SIAM International Conference on Data Mining, 165-176, 2010
832010
Post-learning optimization of tree ensembles for efficient ranking
C Lucchese, FM Nardini, S Orlando, R Perego, F Silvestri, S Trani
Proceedings of the 39th International ACM SIGIR conference on Research and …, 2016
812016
Peer-to-peer systems for discovering resources in a dynamic grid
M Marzolla, M Mordacchini, S Orlando
Parallel computing 33 (4-5), 339-358, 2007
792007
Quality versus efficiency in document scoring with learning-to-rank models
G Capannini, C Lucchese, FM Nardini, S Orlando, R Perego, N Tonellotto
Information Processing & Management 52 (6), 1161-1177, 2016
742016
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20