User Tools

Site Tools


Writing /home/users/ashutosn/public_html/CommNetS2016/dokuwiki/data/cache/8/8202cad0e65a29278e9f81cabd8c5f7e.i failed
Unable to save cache file. Hint: disk full; file permissions; safe_mode setting.
Writing /home/users/ashutosn/public_html/CommNetS2016/dokuwiki/data/cache/8/8202cad0e65a29278e9f81cabd8c5f7e.metadata failed
computation_over_networks
Writing /home/users/ashutosn/public_html/CommNetS2016/dokuwiki/data/cache/4/4c47e099ad93cfdd49da21f4cec5aad6.i failed
Unable to save cache file. Hint: disk full; file permissions; safe_mode setting.
Writing /home/users/ashutosn/public_html/CommNetS2016/dokuwiki/data/cache/4/4c47e099ad93cfdd49da21f4cec5aad6.xhtml failed

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

computation_over_networks [2016/09/01 19:15] (current)
Line 1: Line 1:
 +=== Computation over Networks ===
  
 +Nikhil Karamchandani, ​ University of California at San Diego
 +Wednesday Oct 20th. 2010\\
 +2:00pm\\
 +EEB 248\\
 +
 +
 +**Abstract:​** ​
 +The general problem of computation over networks can be used to
 +model many different scenarios, ranging from environmental monitoring to
 +intrusion detection. The goal in such problems is to design efficient
 +schemes for computing different target functions over various network
 +topologies.
 +
 +In the first part of the talk, we will model the problem as a
 +generalization of "​network coding"​ and attempt to characterize the maximum
 +"rate of computation"​. A cut-based upper bound is proposed and we study
 +the tightness of this bound for different target functions and network
 +topologies.
 +
 +The second part of the talk will focus on a model more suitable for real
 +dynamic networks. In such networks, it is infeasible to continuously adapt
 +the operations at all nodes according to the changing network topology or
 +demand function. Hence, we will restrict most nodes in the network to
 +always perform the same operation (in particular, randomized linear
 +network coding) and only some nodes will change operations depending on
 +the the current target function/​topology. We will study efficient
 +computation schemes for different functions in this model.
 +
 +**Biography:​**
 +
 +Bio: Nikhil Karamchandani received the B.Tech degree in Electrical
 +Engineering from the Indian Institute of Technology, Bombay in 2005, the
 +M.S. degree in Electrical Engineering from the University of California at
 +San Diego in 2007, and is currently pursuing the Ph.D. degree in the
 +Department of Electrical
 +and Computer Engineering,​ University of California at San Diego.
 +His research interests are in communication theory and include network
 +coding, information theory, and random graphs. He received the California
 +Institute for Telecommunications and Information Technology (CalIT2)
 +fellowship in 2005.
 +
 +Host: Alex Dimakis, dimakis [at] usc.edu
 +
 +Back to [[start | CommNetS Seminar Page ]]
computation_over_networks.txt ยท Last modified: 2016/09/01 19:15 (external edit)