Welcome to DiSC 2002
SIGMOD 2001
PODS 2001
SIGMOD RECORD 2001
CIKM 2001
CoopIS 2001
DASFAA 2001
DASFAA 2000
DBPL 2001
Data Engineering Bul
DEXA_EC-WEB 2001
DMKD 2001
DPDJ 2001
HYPERTEXT 2001
ICDE 2001
ICDM 2001
ICDT 2001
JCDL 2001
KDD 2001
KDD_EXPLORATIONS 20
KRDB 2001
MDM 2001
MIR 2001
MIS 2001
RIDE 2001
SBBD 2001
SIGIR 2001
SIGIR FORUM 2001
SSDBM 2001
SSTD 2001
TODS 2001
TIME 2001
VLDB 2001
VLDBJ 2001
About DiSC 2002
Editorial Board
Acknowledgements
DiSC 2002 Production
ADVIS
DiSC'02 Feedback
DiSC'02 Sitemap
Search DiSC'02
<<<Author Index>>>
Copyright Notice

Guido Proietti

Papers on DiSC'02


Size Estimation of the Intersection Join between Two Line Segment Datasets

Publications


Note: Links lead to the DBLP on the Web.

Guido Proietti

33 Enrico Nardelli , Guido Proietti, Peter Widmayer : Swapping a Failing Edge of a Single Source Shortest Paths Tree Is Good and Fast. Algorithmica 35 (1): 56-74 (2003)

32 Enrico Nardelli , Guido Proietti, Peter Widmayer : Finding the most vital node of a shortest path. TCS 296 (1): 167-177 (2003)

31 Hans-Joachim Böckenhauer , Dirk Bongartz , Juraj Hromkovic , Ralf Klasing , Guido Proietti, Sebastian Seibert , Walter Unger : On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality. FSTTCS 2002 : 59-70

30 Anna Galluccio , Guido Proietti: A Faster Approximation Algorithm for 2-Edge-Connectivity Augmentation. ISAAC 2002 : 150-162

29 Enrico Nardelli , Guido Proietti, Peter Widmayer : Finding the Most Vital Node of a Shortest Path. COCOON 2001 : 278-287

28 Anna Galluccio , Guido Proietti: Polynomial Time Algorithms for Edge-Connectivity Augmentation of Hamiltonian Paths. ISAAC 2001 : 345-354

27 Yannis Manolopoulos , Enrico Nardelli , Guido Proietti, Eleni Tousidou : A generalized comparison of linear representations of thematic layers. DKE 37 (1): 1-23 (2001)

26 Michele Flammini , Enrico Nardelli , Guido Proietti: ATM layouts with bounded hop count and congestion. Distributed Computing 14 (2): 65-73 (2001)

25 Enrico Nardelli , Guido Proietti, Peter Widmayer : A faster computation of the most vital edge of a shortest path. Information Processing Letters 79 (2): 81-85 (2001)

24 Guido Proietti, Christos Faloutsos : Accurate Modeling of Region Data. TKDE 13 (6): 874-883 (2001)

23 Enrico Nardelli , Guido Proietti: Size Estimation of the Intersection Join between Two Line Segment Datasets. ADBIS-DASFAA 2000 : 229-238

22 Guido Proietti: Dynamic Maintenance Versus Swapping: An Experimental Study on Shortest Paths Trees. Algorithm Engineering 2000 : 207-217

21 Enrico Nardelli , Guido Proietti, Peter Widmayer : Maintaining a Minimum Spanning Tree Under Transient Node Failures. ESA 2000 : 346-355

20 Enrico Nardelli , Guido Proietti: An efficient spatial access method for spatial images containing multiple non-overlapping features. Information Systems 25 (8): 553-568 (2000)

19 Guido Proietti, Christos Faloutsos : Analysis of Range Queries and Self-Spatial Join Queries on Real Region Datasets Stored Using an R-Tree. TKDE 12 (5): 751-762 (2000)

18 Enrico Nardelli , Guido Proietti: S*-Tree: An Improved S + -Tree for Coloured Images. ADBIS 1999 : 156-167

17 Enrico Nardelli , Guido Proietti, Peter Widmayer : How to Swap a Failing Edge of a Single Source Shortest Paths Tree. COCOON 1999 : 144-153

16 Guido Proietti, Christos Faloutsos : I/O Complexity for Range Queries on Region Data Stored Using an R-tree. ICDE 1999 : 628-635

15 Yihong Gong , Guido Proietti, David LaRose : A Robust Image Mosaicing Technique Capable of Creating Integrated Panoramas. IV 1999 : 24-

14 Guido Proietti: An Optimal Algorithm for Decomposing a Window into Maximal Quadtree Blocks. Acta Informatica 36 (4): 257-266 (1999)

13 Carlo Gaibisso , Enrico Nardelli , Guido Proietti: Intersection Reporting on Two Collections of Disjoint Sets. Information Sciences 114 (1-4): 41-52 (1999)

12 Guido Proietti, Christos Faloutsos : Selectivity Estimation of Window Queries. CIKM 1998 : 340-347

11 Enrico Nardelli , Guido Proietti, Peter Widmayer : Finding All the Best Swaps of a Minimum Diameter Spanning Tree under Transient Edge Failures. ESA 1998 : 55-66

10 Enrico Nardelli , Guido Proietti, Peter Widmayer : Finding the Detour-Critical Edge of a Shortest Path Between Two Nodes. Information Processing Letters 67 (1): 51-54 (1998)

9 Carlo Gaibisso , Guido Proietti: Efficient Insertion of Approximately Sorted Seqeunces of Items into a Dictionary. SOFSEM 1997 : 399-406

8 Michele Flammini , Enrico Nardelli , Guido Proietti: ATM Layouts with Bounded Hop Count and Congestion. WDAG 1997 : 52-65

7 Enrico Nardelli , Guido Proietti: Time and Space Efficient Secondary Memory Representation of Quadtrees. IS 22 (1): 25-37 (1997)

6 Yannis Manolopoulos , Enrico Nardelli , Apostolos Papadopoulos , Guido Proietti: MOF-Tree: A Spatial Access Method to Manipulate Multiple Overlapping Features. IS 22 (8): 465-481 (1997)

5 Carlo Gaibisso , Enrico Nardelli , Guido Proietti: An Output Sensitive Solution to the Set Union and Intersection Problem. SOFSEM 1996 : 351-358

4 Yannis Manolopoulos , Enrico Nardelli , Guido Proietti, Michael Vassilakopoulos : On the Generation of Aggregated Random Spatial Regions. CIKM 1995 : 318-325

3 Enrico Nardelli , Guido Proietti: Efficient Secondary Memory Processing of Window Queries on Spatial Data. Information Sciences 84 (1&2): 67-83 (1995)

2 Enrico Nardelli , Guido Proietti: An Accurate Model for Quadtrees Representing Noiseless Images of Spatial Data. ICIP (2) 1994 : 610-614

1 Enrico Nardelli , Guido Proietti: A Hybrid Pointerless Representation of Quadtrees for Efficient Processing of Window Queries. IGIS 1994 : 259-269




DiSC'02 © 2003 Association for Computing Machinery