[Nrg-l] NRG this Monday[CHANGE OF PLACE]

Niky Riga inki at cs.bu.edu
Mon May 16 13:04:52 EDT 2005

Since we are having the last coffee/tea of the semester at 3:00pm at
MCS135 I think it is better to relocate NRG for this week and have the
talk at MCS135 after the tea. We can invite and the rest to attend the

See you all at 4:00pm.

question = ( to ) ? be : ! be;
                -- Wm. Shakespeare

---------- Forwarded message ----------
Date: Fri, 13 May 2005 13:17:53 -0400 (EDT)
From: Niky Riga <inki at cs.bu.edu>
To: nrg-l at cs.bu.edu
Subject: [Nrg-l] NRG this Monday


It is my pleasure to announce that this Monday John will be giving a talk
at our weekly NRG meeting. We are going to meet as usual at 4:00pm at
the graduate lounge. The abstrack of the talk follows.


Title: Unveiling Hidden Topologies: Applications, Algorithms and

Abstract: We consider a set of applications in Internet topology 
measurement, bioinformatics and physics in which the aim is to identify
statistical or structural properties of a network whose nodes are either
fully or partially known in advance, but whose edge connectivity is not
known. In exact versions of the problems, the goal is to minimize the
number of application-specific probes needed to correctly
identify a subtopology (e.g. a hidden matching in one gene sequencing
In approximate versions of the problems, the goal is to maximize the
accuracy of estimates produced on a fixed measurement budget
(e.g. parameters describing the degree distribution of an Internet
topology). In addition to discussing algorithms and lower bounds, we
consider the role played by measurement artifacts
such as sampling bias, and the impact that modeling assumptions have on
algorithmic performance.

[This is a reprise of an invited talk given at the "Models of Real-World
Random Networks" workshop at MSRI in Berkeley:

question = ( to ) ? be : ! be;
                -- Wm. Shakespeare

Nrg-l mailing list
Nrg-l at cs.bu.edu

More information about the Nrg-l mailing list