<br><br><div class="gmail_quote"><br><div class="gmail_quote">---------- Forwarded message ----------<br>From: <b class="gmail_sendername">Tim Finin</b> <span dir="ltr"><<a href="mailto:finin@cs.umbc.edu" target="_blank">finin@cs.umbc.edu</a>></span><br>
Date: Thu, Sep 20, 2012 at 3:26 PM<br>
Subject: [Csee-faculty-tt] [CSEE-colloq] talk: Wolff Local Thresholding for Structured and Unstructured Graphs, 2pm Fri 9/28<br>To: <a href="mailto:csee-colloquium-out@cs.umbc.edu" target="_blank">csee-colloquium-out@cs.umbc.edu</a><br>
<br>
<br> UMBC CSEE Colloquium<br>
<br>
Local Thresholding for Structured and Unstructured Graphs<br>
<br>
Dr. Ran Wolff, Haifa University, Israel<br>
<a href="http://is.haifa.ac.il/~rwolff" target="_blank">http://is.haifa.ac.il/~rwolff</a><br>
<br>
2:00pm Friday, 28 September 2012, ITE 325B<br>
** NOTE UNUSUAL TIME AND ROOM **<br>
<br>
Local thresholding algorithms were first offered a decade ago as a<br>
communication thrifty alternative for computation in large distributed<br>
environments. Their disadvantage, however, has always been in their<br>
brittleness. A single cycle in the communication graph could mean the<br>
algorithm converges to the wrong value. This talk describes two<br>
advances in local thresholding algorithms which overcome the demand<br>
for cycle freedom. The first is a local tree induction protocol for<br>
structured peer-to-peer networks which seamlessly integrates with the<br>
local thresholding algorithm. The second are new local stopping and<br>
update rules which permit execution of the local thresholding<br>
algorithm on general graphs. The first solution vastly outperforms a<br>
gossip based algorithm on simple computation tasks in a Chord-like<br>
peer-to-peer network. The second may transform the way data is<br>
processed in wireless sensor networks, where gossip is mostly<br>
considered impermissibly costly.<br>
<br>
UMBC Host: Hillol Kargupta, <a href="mailto:hillol@cs.umbc.edu" target="_blank">hillol@cs.umbc.edu</a><br>
<br>
<br>
<br>
--<br>
For info and options, see <a href="http://lists.cs.umbc.edu/mailman/listinfo/csee-colloquium-out" target="_blank">http://lists.cs.umbc.edu/<u></u>mailman/listinfo/csee-<u></u>colloquium-out</a><br>
______________________________<u></u>_________________<br>
Csee-faculty-tt mailing list<br>
<a href="mailto:Csee-faculty-tt@cs.umbc.edu" target="_blank">Csee-faculty-tt@cs.umbc.edu</a><br>
<a href="http://lists.cs.umbc.edu/mailman/listinfo/csee-faculty-tt" target="_blank">http://lists.cs.umbc.edu/<u></u>mailman/listinfo/csee-faculty-<u></u>tt</a><br>
</div><br>
</div><br>