Sciweavers

388 search results - page 41 / 78
» Robust Lower Bounds for Communication and Stream Computation
Sort
View
CDC
2009
IEEE
144views Control Systems» more  CDC 2009»
15 years 9 months ago
Stochastic control over finite capacity channels: Causality, feedback and uncertainty
Abstract-- Optimal communication/control analysis and design of dynamical controlled systems, when there are finite capacity communication constraints often involve information and...
Charalambos D. Charalambous, Christos K. Kourtella...
SOSP
2003
ACM
16 years 3 months ago
SplitStream: high-bandwidth multicast in cooperative environments
In tree-based multicast systems, a relatively small number of interior nodes carry the load of forwarding multicast messages. This works well when the interior nodes are highlyava...
Miguel Castro, Peter Druschel, Anne-Marie Kermarre...
ATAL
2007
Springer
16 years 8 days ago
On the robustness of preference aggregation in noisy environments
In an election held in a noisy environment, agents may unintentionally perturb the outcome by communicating faulty preferences. We investigate this setting by introducing a theore...
Ariel D. Procaccia, Jeffrey S. Rosenschein, Gal A....
BIOSYSTEMS
2007
123views more  BIOSYSTEMS 2007»
15 years 6 months ago
Real time computation: Zooming in on population codes
Information processing in nervous systems intricately combines computation at the neuronal and network levels. Many computations may be envisioned as sequences of signal processin...
Olivier Rochel, Netta Cohen
163
Voted
WG
1998
Springer
15 years 10 months ago
Graphs with Bounded Induced Distance
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...
Serafino Cicerone, Gabriele Di Stefano