|
Search the dblp DataBase
Giuseppe M. Mazzeo:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Filippo Furfaro, Giuseppe M. Mazzeo, Cristina Sirangelo
Clustering-Based Histograms for Multi-dimensional Data. [Citation Graph (0, 0)][DBLP] DaWaK, 2005, pp:478-487 [Conf]
- Filippo Furfaro, Giuseppe M. Mazzeo, Cristina Sirangelo
Exploiting Cluster Analysis for Constructing Multi-dimensional Histograms on Both Static and Evolving Data. [Citation Graph (0, 0)][DBLP] EDBT, 2006, pp:442-459 [Conf]
- Alfredo Cuzzocrea, Filippo Furfaro, Giuseppe M. Mazzeo, Domenico Saccà
A Grid Framework for Approximate Aggregate Query Answering on Summarized Sensor Network Readings. [Citation Graph (0, 0)][DBLP] OTM Workshops, 2004, pp:144-153 [Conf]
- Alfredo Cuzzocrea, Filippo Furfaro, Sergio Greco, Elio Masciari, Giuseppe M. Mazzeo, Domenico Saccà
A Distributed System for Answering Range Queries on Sensor Network Data. [Citation Graph (0, 0)][DBLP] PerCom Workshops, 2005, pp:369-373 [Conf]
- Filippo Furfaro, Giuseppe M. Mazzeo, Domenico Saccà, Cristina Sirangelo
Hierarchical binary histograms for summarizing multi-dimensional data. [Citation Graph (0, 0)][DBLP] SAC, 2005, pp:598-603 [Conf]
- Alfredo Cuzzocrea, Filippo Furfaro, Elio Masciari, Giuseppe M. Mazzeo, Domenico Saccà
Efficiently Representing and Querying Sensor Network Readings on Data Grids. [Citation Graph (0, 0)][DBLP] SEBD, 2006, pp:373-382 [Conf]
- Filippo Furfaro, Giuseppe M. Mazzeo, Domenico Saccà, Cristina Sirangelo
A New Histogram-based Technique for Compressing Multi-Dimensional Data. [Citation Graph (0, 0)][DBLP] SEBD, 2004, pp:18-29 [Conf]
A Probabilistic Approach for Computing Approximate Iceberg Cubes. [Citation Graph (, )][DBLP]
Efficiently Computing Iceberg Cubes: A Probabilistic Approach. [Citation Graph (, )][DBLP]
A Framework for Outlier Mining in RFID Data. [Citation Graph (, )][DBLP]
A Probabilistic Framework for Building Privacy-Preserving Synopses of Multi-dimensional Data. [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.002secs
|