Alessandro Tiberi

Learn More
Finding near(est) neighbors is a classic, difficult problem in data management and retrieval, with applications in text and image search,in finding similar objects and matching patterns. Here we study <i>cluster pruning</i>, an extremely simple randomized technique. During preprocessing we randomly choose a subset of data points to be <i>leaders</i> the(More)
We investigate synchronized hyperedge replacement (SHR) as general framework for distributed programming and system design. We propose a slender version of SHR which dramaticaly reduces the mathematical overhead of the original proposal [5] and use it to interpret the distributed CCS [7] and the calculus of Mobile Ambients [1] in a uniform semantic(More)
Document clustering is an effective tool to manage information overload. By grouping similardocuments together, we enable a human observer to quickly browse large document collections,make it possible to easily grasp the distinct topics and subtopics. In this Paper we survey the most important problems and techniques relatedto text information retrieval:(More)
Synchronising Graphs is a system of parallel graph transformation designed for modeling process interaction in a network environment. Although notions of observational equivalence are abundant in the literature for process calculi, not so for graph rewriting, where system behaviour is typically context dependent. We propose a theory of context-free(More)
  • 1