Sign In


Sort by AttachmentsUse SHIFT+ENTER to open the menu (new window).
wireless networks cycle Use SHIFT+ENTER to open the menu (new window).
D. Spano

when: 11/2/2011 at 11AM

Where: sala seminari est

speaker: D. Spano

Title: Bubble RAP: Social Based Forwarding in Delay Tolerant Networks



Pocket Switched Networks exploit human mobility for creating contact opportunities in absence of a fixed network structure. In such environment it is possible to exploit social-based forwarding techniques in order to improve delivery efficiency and to lower the communication cost. Hui, Crowcroft and Yoneki introduced the BUBBLE forwarding algorithm, which improved the forwarding efficiency compared with the probabilistic routing protocol PROPHET. This seminar discusses the BUBBLE algorithm, community detection and centrality measuring techniques involved in forwarding, considering a centralized and a distributed implementation.



Year: 2011
Semantica categoriale della concorrenzaUse SHIFT+ENTER to open the menu (new window).
Pawel Sobocinski, Fabio Gadducci

Il ciclo di seminari si prefigge lo scopo di presentare alcune problematiche legate alla semantica dei sistemi concorrenti e distribuiti. Dopo una serie introduttiva di lezioni, ove vengono presentati i concetti di base ed alcuni modelli utilizzati per le reti di Petri, gli studenti terranno un seminario su un argomento concordato con il prof. Gadducci.

lunedì 6.VI, Pawel Sobocinski: Concetti categoriali di base (3h)                                       Sala riunioni ovest, ore 14.30

martedì 7.VI, Fabio Gadducci: Reti di Petri: modelli logici e categoriali per le reti (3h)         Sala riunioni ovest, ore 14.30

mercoledì 8.VI, Pawel Sobocinski: Reti open e wire calculus (3h)                                      Sala riunioni ovest, ore 9.30


Year: 2011
String processing and information retrievalUse SHIFT+ENTER to open the menu (new window).
Corinna Cortes, Mehryar Mohr -- Vanessa Murdock, Gary Gale -- Francisco Claude, Gonzalo Navarro -- Ricardo Baeza-Yates

Cortes & Mohri

Introduction to Sequence Learning Problems and Algorithms

This tutorial presents an introduction to machine learning algorithms
and methods dealing with sequences. Sequence learning problems arise in
a variety of areas including computational biology, natural language
processing, speech processing, video processing, and search engine
design. Large-scale training sets of labeled sequences are used for a
variety of learning tasks in these areas. We describe several
fundamental algorithms and techniques for sequence learning, discuss
their theoretical foundation, and illustrate their applications to a
number of tasks. We also outline several problems that could serve as
research topics for the combinatorial string matching and string
analysis community.
Murdock & Gale

Computational Geography

As the industry moves to personalization and mobility, users expect
their applications to be location savvy, and relevant to their lives in
increasing detail. While we can pinpoint a user at a location within
700 meters with just their IP address, and within a meter with their
GPS-enabled mo- bile phone, we fall short when it comes to
understanding their geographic context. A person’s geographic context
in-    cludes their current and previous location, the things that
surround them, their activity in a given place, as well as their
thoughts and feelings in that place. Understanding this context
allows us to personalize their experience and refine their
interactions with an application, on a hyper-local level.  This
tutorial provides the participant with the information needed to
leverage the locations implicit and explicit in the data. It
covers the fundamentals of how geographic data  is organized in
official sources and gazetteers, how social media data can be
leveraged, and the open data and software resources that are
available to the researcher. In addition,  we cover the
state-of-the-art in modeling locations, with an overview of
applications of geo information, and a discussion of open
problems and the needs of industry.
Claude & Navarro

Space-Efficient Data Structures

This tutorial will present succinct and compressed data structures for
bitmaps and sequences. We aim at covering these two basic building
blocks for many space-efficient data structures from a practical point
of view. We will then show how to implement space-efficient data
structures of various kinds using the results from bitmaps and
sequences. We will firsts move into text self-indexing, presenting a
detailed description of the SSA-index, a compressed text self-index. We
will include a simple hands-on example guiding the audience through a
full implementation of this index using libcds, a library implementing
several space-efficient data structures. This library is maintained by
the authors and available at We will finally
show how to use bitmaps and sequences to achieve simple and powerful
compact representations of graphs, permutations, and binary


Introduction to Web Retrieval

While many SPIRE attendees know the basics of IR, they may be unaware
of many of the differences with Web retrieval; the technology behind
this business, and the business itself, is far from trivial. This part
provides an introduction to the main concepts, issues, and techniques
of web-based information retrieval. Topics covered include the
differences between conventional and web IR, the evolution of web
search technology, software architecture, scalability issues, crawling
and corpus construction, duplicate detection, link analysis, and Web
spam. The presentation will be largely self-contained: prerequisites
include a basic understanding of elementary IR concepts, algorithms and
data structures, linear algebra, and probability theory.


Further seminars will be assigned to students by the organisers,

Nadia Pisanti and Roberto Grossi


NB PhD students are not requested to pay any registration fee. Pl. contact Nadia Pisanti for more details.

Year: 2011