MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for authors named "Guido Proietti" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

12 documents found, showing 1 through 10. Next 10 →

ATOM

I/O Complexity for Range Queries on Region Data Stored Using an R-tree
by Guido Proietti, Christos Faloutsos — 1999
…I/O Complexity for Range Queries on Region Data Stored Using an R-tree Guido Proietti # Dip. di…
Cited by 15 (3 self) – Add To MetaCart

Accurate Modeling of Region Data
by Guido Proietti, Christos Faloutsos — 1998 — Carnegie-Mellon University
…Accurate modeling of region data Guido Proietti 1 Christos Faloutsos 2 April 1998 CMU-CS-98…
Cited by 8 (5 self) – Add To MetaCart

Selectivity Estimation of Window Queries for Line Segment Datasets
by Guido Proietti, Christos Faloutsos — 1998 — In Proceedings 7th Conference on Information and Knowledge Management (CIKM’98
…Selectivity Estimation of Window Queries for Line Segment Datasets Guido Proietti Dept…
Cited by 6 (2 self) – Add To MetaCart

An Optimal Resolution Sensitive Pyramid Representation for Hierarchical Memory Models
by Enrico Nardelli, Guido Proietti — 1994 — Journal of Computing and Information
… Sensitive Pyramid Representation for Hierarchical Memory Models Enrico Nardelli, Guido Proietti Dipartimento…
Cited by 1 (0 self) – Add To MetaCart

Size estimation of the intersection join between two line segment datasets
by Enrico Nardelli, Guido Proietti — 2000 — In Proceedings 4rd East-European Conference on Advances in Databases and Information Systems (ADBIS 2000
…,2 and Guido Proietti 1,2 1 Dipartimento di Matematica Pura ed Applicata, Università di L’Aquila, Via Vetoio…
Cited by 2 (2 self) – Add To MetaCart

Maintaining a minimum spanning tree under transient node failures
by Enrico Nardelli, Guido Proietti — Proc. of the 8th European Symposium on Algorithms (ESA 2000
…Maintaining a Minimum Spanning Tree under Transient Node Failures ⋆ Enrico Nardelli 1,2 , Guido…
Cited by 1 (1 self) – Add To MetaCart

Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failures
by Enrico Nardelli, Guido Proietti — 1998 — Journal of Graph Algorithms and Applications
… ⋆ Enrico Nardelli 1,2 , Guido Proietti 1,3 ,andPeterWidmayer 4 1 Dipartimento di Matematica Pura ed…
Cited by 11 (5 self) – Add To MetaCart

G.: ATM Layouts with Bounded Hop Count and Congestion
by Michele Flammini, Enrico Nardelli, Guido Proietti — 1997 — Proc. of the 11th Workshop on Distributes Algorithms - WDAG 97
…'3 and Guido Proietti 1 Dipartimento di Matematica Pura ed Applicata, Universit~ degli Studi di L'Aquila, via…
Cited by 1 (0 self) – Add To MetaCart

Swapping a failing edge of a single source shortest paths tree is good and fast
by Enrico Nardelli, Guido Proietti, Peter Widmayer — 1999 — Algorithmica
… Nardelli, 2 Guido Proietti, 2 and Peter Widmayer 3 Abstract. Let G = (V, E) be a 2-edge connected…
Cited by 13 (5 self) – Add To MetaCart

Finding the most vital node of a shortest path
by Enrico Nardelli, Guido Proietti, Peter Widmayer — 2001 — In Proc. COCOON
…Finding the Most Vital Node of a Shortest Path ⋆ Enrico Nardelli 1,2 , Guido Proietti 1…
Cited by 5 (0 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB