Giorgio Gambosi

ORCID: 0000-0001-9979-6931
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Interconnection Networks and Systems
  • Advanced Graph Theory Research
  • Optimization and Search Problems
  • Topic Modeling
  • Complex Network Analysis Techniques
  • Algorithms and Data Compression
  • Data Management and Algorithms
  • Complexity and Algorithms in Graphs
  • Advanced Text Analysis Techniques
  • Advanced Manufacturing and Logistics Optimization
  • Scheduling and Optimization Algorithms
  • Sentiment Analysis and Opinion Mining
  • Computational Geometry and Mesh Generation
  • Computability, Logic, AI Algorithms
  • Semantic Web and Ontologies
  • Optimization and Packing Problems
  • Natural Language Processing Techniques
  • Distributed systems and fault tolerance
  • Advanced Database Systems and Queries
  • Web Data Mining and Analysis
  • Service-Oriented Architecture and Web Services
  • graph theory and CDMA systems
  • Opinion Dynamics and Social Influence
  • Advanced Optical Network Technologies
  • Software Testing and Debugging Techniques

University of Rome Tor Vergata
2011-2024

Istituto Superiore di Sanità
2023

University of L'Aquila
1993-2011

Istituto di Analisi dei Sistemi ed Informatica Antonio Ruberti
1984-2006

Sapienza University of Rome
1994-2002

Informa (Italy)
2002

Cornell University
1996

Universitat Politècnica de Catalunya
1996

Karlsruhe University of Education
1996

Utrecht University
1996

The typical online bin-packing problem requires the fitting of a sequence rationals in (0,1] into minimum number bins unit capacity, by packing ith input element without any knowledge sizes or elements that follow. Moreover, unlike problems, this one issue does not admit data reorganization, i.e., no can be moved from bin to another. In paper, first all, "Relaxed" model will formalized; allows constant move another, as consequence arrival new element. Then, context model, two algorithms...

10.1137/s0097539799180408 article EN SIAM Journal on Computing 2000-01-01

We present the results of our exploratory analysis on relationship that exists between relevance and time. observe how amount documents published in a given interval time is related to probability relevance, and, using series analysis, we show existence correlation relevance. As an initial application this study query expansion exploiting detection publication peaks over Blog06 collection. finally propose effective approach for blog search domain. Our based trend being so completely...

10.1145/2063576.2063868 article EN 2011-10-24

10.1016/0304-3975(90)90125-2 article EN publisher-specific-oa Theoretical Computer Science 1990-01-01

This paper deals with the problem of store-and-forward deadlock prevention in networks. The presented solution uses time stamping all messages network, and a nonpreemptable message exchange mechanism. By combining these ideas, new distributed flow control procedure is derived which guarantees that are delivered to their own destinations, thus avoiding both livelock without any loss. It shown some properties this depend on policy allocation buffers nodes. On one hand, an optimal strategy...

10.1109/tcom.1987.1096799 article EN IEEE Transactions on Communications 1987-01-01

The introduction of sophisticated waste treatment plants is making the process trash sorting and recycling more effective eco-friendly. Studies on Automated Waste Sorting (AWS) are greatly contributing to whole efficient. However, a relevant issue, which remains unsolved, how deal with large amount that littered in environment instead being collected properly. In this paper, we introduce BackRep: method for building recognizers can be used identifying directly where it found. BackRep...

10.3390/jimaging7080144 article EN cc-by Journal of Imaging 2021-08-12

10.1016/s0304-3975(97)00070-4 article EN Theoretical Computer Science 1998-09-01
Coming Soon ...