-
Prof. Erik Aurell (KTH), Mikko Alava (HUT, Espoo, Finland)15/05/2008, 09:00
-
Dr Supriya Krishnamurthy (SICS)15/05/2008, 09:20Overlay networks are application-level networks, or networks of acquaintances, established on top of physical networks, such as the Internet. Peer-to-Peer (P2P) systems are one class of overlay networks, in which all nodes in the system are equivalent and all tasks are carried out without the presence of any central authority. Despite their relatively short history, peer-to-peer overlays...Go to contribution page
-
Prof. Riccardo Zecchina (Politecnico di Torino)15/05/2008, 10:00Given an undirected graph with positive weights on the edges, the Minimum Weight Steiner Tree (MST) problem consists in finding a connected subgraph of minimum weight that contains a selected set of ``terminal'' vertices. Such construction may require the inclusion of some non-terminal nodes which are called Steiner nodes. Clearly, an optimal sub-graph must be a tree. Solving MST is a...Go to contribution page
-
Dr Luca Dall'Asta (Abdus Salam ICTP)15/05/2008, 11:00Many efforts have been devoted to characterize the onset of congestion in communication networks. Numerical simulations performed using complex routing protocols have revealed that congestion always occurs as an effect of traffic increase, but with specific features that strictly depend on the local routing scheme. (For instance, the continuous or discontinuous character of the...Go to contribution page
-
Jakob Nordström (KTH)15/05/2008, 11:20Most state-of-the-art satisfiability algorithms today are variants of the DPLL procedure augmented with clause learning. The main bottleneck for such algorithms, other than the obvious one of time, is the amount of memory used. In the field of proof complexity, the resources of time and memory correspond to the length and space of resolution proofs. There has been a long line of...Go to contribution page
-
Jeremy Stribling (MIT CSAIL)15/05/2008, 13:00It is a challenge to build applications that need to share data and are distributed across hundreds or thousands of computers in a wide-area network (e.g., PlanetLab or on a Grid). In order to cope with high latency, throughput bottlenecks, and temporary failures, such applications typically implement their own storage plan or use special-purpose storage solutions (e.g., DISC,...Go to contribution page
-
Danny Bickson (The Hebrew University of Jerusalem)15/05/2008, 14:00The canonical linear-algebraic problem of solving a system of linear equations arises in numerous contexts in the mathematical sciences and engineering. In this talk, we introduce an efficient Gaussian belief propagation (GaBP) solver that does not involve direct matrix inversion. The iterative nature of our approach allows for a distributed message-passing implementation of the solution...Go to contribution page
-
Dr Dimos Dimarogonas (KTH)15/05/2008, 14:20Multi-agent consensus problems where agents aim to attain a common value of some quantity under limited communication have received increasing attention recently, due to their application in multi-vehicle and multi-robot systems, as well as distributed estimation and filtering in networked systems. In this talk we present two recent results on consensus problems. The first part of the...Go to contribution page
-
Dr Meesoon Ha (KAIST)15/05/2008, 15:00A finite-size-scaling (FSS) theory is proposed for various models in complex networks. In particular, we focus on the FSS exponent, which plays a crucial role in analyzing numerical data for finite-size systems. Based on the droplet-excitation (hyperscaling) argument, we conjecture the values of the FSS exponents for the Ising model, the susceptible-infected-susceptible model, and the...Go to contribution page
-
Prof. Olav Tirkkonen (TKK)15/05/2008, 15:20
-
Mikko Alava (HUT, Espoo, Finland)15/05/2008, 16:00
-
Dr György Dan (KTH)15/05/2008, 16:20A large number of peer-to-peer streaming systems has been proposed and deployed in recent years. Yet, there is no clear understanding of how these systems scale and how multi-path and multihop transmission, properties of all recent systems, affect the quality experienced by the peers. In this talk we present an analytical study that considers the relationship between delay and loss for...Go to contribution page
-
Prof. Bernhard Mehlig (Chalmers University of Technology)15/05/2008, 16:40
Choose timezone
Your profile timezone: