Sfoglia per Autore
Efficient Secondary Memory Processing of Window Queries on Spatial Data
1995-01-01 E., Nardelli; Proietti, Guido
On the Creation of Quadtrees by Using a Branching Process
1996-01-01 Y., Manolopoulos; E., Nardelli; Proietti, Guido; M., Vassilakopoulos
MOF-tree: a Spatial Access Method to Manipulate Multiple Overlapping Features
1997-01-01 Y., Manolopoulos; E., Nardelli; A., Papadopoulos; Proietti, Guido
Time and Space Efficient Secondary Memory Representation of Quadtrees
1997-01-01 E., Nardelli; Proietti, Guido
ATM Layouts with Bounded Hop Count and Congestion
1997-01-01 Flammini, Michele; Nardelli, E; Proietti, G.
Finding the Detour-Critical Edge of a Shortest Path between Two Nodes
1998-01-01 E., Nardelli; Proietti, Guido; P., Widmayer
Intersection Reporting on Two Collections of Disjoint Sets
1999-01-01 C., Gaibisso; E., Nardelli; Proietti, Guido
Probabilistic Models for Images and Quadtrees: Differences and Equivalences
1999-01-01 E., Nardelli; Proietti, Guido
How to Swap a Failing Edge of a Single Source Shortest Paths Tree
1999-01-01 E., Nardelli; Proietti, Guido; P., Widmayer
An Optimal Algorithm for Decomposing a Window into Maximal Quadtree Blocks
1999-01-01 Proietti, Guido
Dynamic Maintenance Versus Swapping: An Experimental Study on Shortest Paths Trees
2000-01-01 Proietti, Guido
Maintaining a Minimum Spanning Tree Under Transient Node Failures
2000-01-01 E., Nardelli; Proietti, Guido; P., Widmayer
An Efficient Spatial Access Method for Spatial Images Containing Multiple Non-Overlapping Features
2000-01-01 E., Nardelli; Proietti, Guido
Analysis of Range Queries and Self Spatial Join Queries on Real Region Datasets Stored Using an R-tree
2000-01-01 Proietti, Guido; C., Faloutsos
Efficient Management of Transient Station Failures in Linear Radio Communication Networks with Bases
2001-01-01 C., Gaibisso; Proietti, Guido; R. T., Tan
Finding the Most Vital Node of a Shortest Path
2001-01-01 E., Nardelli; Proietti, Guido; P., Widmayer
Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failures
2001-01-01 E., Nardelli; Proietti, Guido; P., Widmayer
Efficient ATM Layouts with Bounded Hop Count and Congestion
2001-01-01 Flammini, Michele; E., Nardelli; Proietti, Guido
ATM Layouts with Bounded Hop Count and Congestion
2001-01-01 Flammini, Michele; Nardelli, E; Proietti, G.
A Faster Computation of the Most Vital Edge of a Shortest Path
2001-01-01 E., Nardelli; Proietti, Guido; P., Widmayer
Legenda icone
- file ad accesso aperto
- file disponibili sulla rete interna
- file disponibili agli utenti autorizzati
- file disponibili solo agli amministratori
- file sotto embargo
- nessun file disponibile