 | 2009 |
|---|
| 44 |       | Yon Dourisboure,
Filippo Geraci,
Marco Pellegrini:
Extraction and classification of dense implicit communities in the Web graph.
TWEB 3(2): (2009) |
| 2008 |
|---|
| 43 | | 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) |
| 42 | | Filippo Geraci,
Marco Pellegrini,
M. Elena Renda:
AMIC@: All MIcroarray Clusterings @ once.
Nucleic Acids Research 36(Web-Server-Issue): 315-319 (2008) |
| 2007 |
|---|
| 41 | | Marco Furini,
Filippo Geraci,
Manuela Montangero,
Marco Pellegrini:
VISTO: visual storyboard for web video browsing.
CIVR 2007: 635-642 |
| 40 | | 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 |
| 39 | | 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 |
| 38 | | Yon Dourisboure,
Filippo Geraci,
Marco Pellegrini:
Extraction and classification of dense communities in the web.
WWW 2007: 461-470 |
| 37 | | Marco Pellegrini,
Giordano Fusco:
Efficient IP table lookup via adaptive stratified trees with selective reconstructions.
ACM Journal of Experimental Algorithmics 12: (2007) |
| 36 | | Filippo Geraci,
Marco Pellegrini:
Dynamic User-Defined Similarity Searching in Semi-Structured Text Retrieval
CoRR abs/0705.4606: (2007) |
| 35 | | Laura Galluccio,
Giacomo Morabito,
Sergio Palazzo,
Marco Pellegrini,
M. Elena Renda,
Paolo Santi:
Georoy: A location-aware enhancement to Viceroy peer-to-peer algorithm.
Computer Networks 51(8): 1998-2014 (2007) |
| 34 | | Gianluca De Marco,
Marco Pellegrini,
Giovanni Sburlati:
Faster deterministic wakeup in multiple access channels.
Discrete Applied Mathematics 155(8): 898-903 (2007) |
| 33 |  | Filippo Geraci,
Marco Pellegrini,
Marco Maggini,
Fabrizio Sebastiani:
Cluster Generation and Labeling for Web Snippets: A Fast, Accurate Hierarchical Solution.
Internet Mathematics 3(4): 413-443 (2007) |
| 2006 |
|---|
| 32 | | Filippo Geraci,
Marco Pellegrini,
Paolo Pisati,
Fabrizio Sebastiani:
A scalable algorithm for high-quality clustering of web snippets.
SAC 2006: 1058-1062 |
| 31 | | 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 |
|---|
| 30 | | Gianluca De Marco,
Marco Pellegrini,
Giovanni Sburlati:
Faster Deterministic Wakeup in Multiple Access Channels.
ICTCS 2005: 196-204 |
| 29 | | Filippo Geraci,
Marco Pellegrini,
Paolo Pisati,
Luigi Rizzo:
Packet classification via improved space decomposition techniques.
INFOCOM 2005: 304-312 |
| 2004 |
|---|
| 28 | | Marco Pellegrini,
Giordano Fusco:
Efficient IP Table Lookup via Adaptive Stratified Trees with Selective Reconstructions.
ESA 2004: 772-783 |
| 2002 |
|---|
| 27 | | Daniele V. Finocchiaro,
Marco Pellegrini:
On computing the diameter of a point set in high dimensional Euclidean space.
Theor. Comput. Sci. 287(2): 501-514 (2002) |
| 2001 |
|---|
| 26 | | Marco Pellegrini:
Randomizing combinatorial algorithms for linear programming when the dimension is moderately high.
SODA 2001: 101-108 |
| 1999 |
|---|
| 25 | | Daniele V. Finocchiaro,
Marco Pellegrini:
On Computing the Diameter of a Point Set in High Dimensional Euclidean Space.
ESA 1999: 365-377 |
| 24 | | Marco Pellegrini:
Rendering Equation Revisited: How to Avoid Explicit Visibility Computations.
SODA 1999: 725-733 |
| 23 | | Marco Pellegrini:
A Geometric Approach to Computing Higher Order Form Factors.
Symposium on Computational Geometry 1999: 69-78 |
| 1998 |
|---|
| 22 | | Marco Pellegrini:
Electrostatic Fields Without Singularities: Theory, Algorithms and Error Analysis.
J. ACM 45(6): 924-964 (1998) |
| 1997 |
|---|
| 21 | | Marco Pellegrini:
On Counting Pairs of Intersecting Segments and Off-Line Triangle Range Searching.
Algorithmica 17(4): 380-398 (1997) |
| 20 | | Marco Pellegrini:
Monte Carlo Approximation of Form Factors with Error Bounded a Priori.
Discrete & Computational Geometry 17(3): 319-337 (1997) |
| 1996 |
|---|
| 19 | | Marco Pellegrini:
Electrostatic Fields without Singularities: Theory and Algorithms.
SODA 1996: 184-191 |
| 18 | | Marco Pellegrini:
Repetitive Hidden Surface Removal for Polyhedra.
J. Algorithms 21(1): 80-101 (1996) |
| 17 | | Marco Pellegrini:
On Point Location and Motion Planning among Simplices.
SIAM J. Comput. 25(5): 1061-1081 (1996) |
| 1995 |
|---|
| 16 | | Marco Pellegrini:
Monte Carlo Approximation of Form Factors with Error Bounded a Priori.
Symposium on Computational Geometry 1995: 287-296 |
| 1994 |
|---|
| 15 | | Marco Pellegrini:
On point location and motion planning among simplices.
STOC 1994: 95-104 |
| 14 | | Marco Pellegrini:
On Lines Missing Polyhedral Sets in 3-Space.
Discrete & Computational Geometry 12: 203-221 (1994) |
| 13 | | Marco Pellegrini:
On Collision-Free Placements of Simplices and the Closest Pair of Lines in 3-Space.
SIAM J. Comput. 23(1): 133-153 (1994) |
| 1993 |
|---|
| 12 | | Marco Pellegrini:
On Lines Missing Polyhedral Sets in 3-Space.
Symposium on Computational Geometry 1993: 19-28 |
| 11 | | Marco Pellegrini:
Repetivive Hidden-Surface-Removal for Polyhedral Scenes.
WADS 1993: 541-552 |
| 10 | | Marco Pellegrini:
Ray Shooting on Triangles in 3-Space.
Algorithmica 9(5): 471-494 (1993) |
| 9 | | Marco Pellegrini:
Lower Bounds on Stabbing Lines in 3-space.
Comput. Geom. 3: 53-58 (1993) |
| 8 | | Boris Aronov,
Marco Pellegrini,
Micha Sharir:
On the Zone of a Surface in a Hyperplane Arrangement.
Discrete & Computational Geometry 9: 177-186 (1993) |
| 7 | | Pankaj K. Agarwal,
Marco Pellegrini,
Micha Sharir:
Counting Circular Arc Intersections.
SIAM J. Comput. 22(4): 778-793 (1993) |
| 1992 |
|---|
| 6 | | Marco Pellegrini:
Incidence and Nearest-Neighbor Problems for Lines in 3-Space.
Symposium on Computational Geometry 1992: 130-137 |
| 5 | | Marco Pellegrini,
Peter W. Shor:
Finding Stabbing Lines in 3-Space.
Discrete & Computational Geometry 8: 191-208 (1992) |
| 1991 |
|---|
| 4 | | Marco Pellegrini,
Peter W. Shor:
Finding Stabbing Lines in 3-Dimensional Space.
SODA 1991: 24-31 |
| 3 | | Marco Pellegrini:
Ray-shooting and Isotopy Classes of Lines in 3-Dimensional Space.
WADS 1991: 20-31 |
| 2 | | Marco Pellegrini,
Raimondo Sepe:
SetLog, a tool for experimenting with new semantics.
SIGPLAN Notices 26(2): 67-74 (1991) |
| 1990 |
|---|
| 1 | | Marco Pellegrini:
Stabbing and Ray Shooting in 3 Dimensional Space.
Symposium on Computational Geometry 1990: 177-186 |
