| 2009 |
|---|
| 11 | EE | Yon Dourisboure,
Filippo Geraci,
Marco Pellegrini:
Extraction and classification of dense implicit communities in the Web graph.
TWEB 3(2): (2009) |
| 2008 |
|---|
| 10 | EE | Loredana M. Genovese,
Filippo Geraci,
Marco Pellegrini:
SpeedHap: An Accurate Heuristic for the Single Individual SNP Haplotyping Problem with Many Gaps, High Reading Error Rate andLow Coverage.
IEEE/ACM Trans. Comput. Biology Bioinform. 5(4): 492-502 (2008) |
| 2007 |
|---|
| 9 | EE | Marco Furini,
Filippo Geraci,
Manuela Montangero,
Marco Pellegrini:
VISTO: visual storyboard for web video browsing.
CIVR 2007: 635-642 |
| 8 | EE | Filippo Geraci,
Mauro Leoncini,
Manuela Montangero,
Marco Pellegrini,
M. Elena Renda:
FPF-SB : A Scalable Algorithm for Microarray Gene Expression Data Clustering.
HCI (12) 2007: 606-615 |
| 7 | EE | Loredana M. Genovese,
Filippo Geraci,
Marco Pellegrini:
A Fast and Accurate Heuristic for the Single Individual SNP Haplotyping Problem with Many Gaps, High Reading Error Rate and Low Coverage.
WABI 2007: 49-60 |
| 6 | EE | Yon Dourisboure,
Filippo Geraci,
Marco Pellegrini:
Extraction and classification of dense communities in the web.
WWW 2007: 461-470 |
| 5 | EE | Filippo Geraci,
Marco Pellegrini:
Dynamic User-Defined Similarity Searching in Semi-Structured Text Retrieval
CoRR abs/0705.4606: (2007) |
| 2006 |
|---|
| 4 | EE | Filippo Geraci,
Marco Pellegrini,
Paolo Pisati,
Fabrizio Sebastiani:
A scalable algorithm for high-quality clustering of web snippets.
SAC 2006: 1058-1062 |
| 3 | EE | Filippo Geraci,
Marco Pellegrini,
Marco Maggini,
Fabrizio Sebastiani:
Cluster Generation and Cluster Labelling for Web Snippets: A Fast and Accurate Hierarchical Solution.
SPIRE 2006: 25-36 |
| 2005 |
|---|
| 2 | EE | Filippo Geraci,
Marco Pellegrini,
Paolo Pisati,
Luigi Rizzo:
Packet classification via improved space decomposition techniques.
INFOCOM 2005: 304-312 |
| 1 | EE | Filippo Geraci,
Roberto Grossi:
Distilling Router Data Analysis for Faster and Simpler Dynamic IP Lookup Algorithms.
WEA 2005: 580-592 |
