Sciweavers

5793 search results - page 1114 / 1159
» Individual communication complexity
Sort
View
MICRO
2009
IEEE
168views Hardware» more  MICRO 2009»
14 years 2 months ago
Ordering decoupled metadata accesses in multiprocessors
Hardware support for dynamic analysis can minimize the performance overhead of useful applications such as security checks, debugging, and profiling. To eliminate implementation ...
Hari Kannan
COCO
2009
Springer
155views Algorithms» more  COCO 2009»
14 years 2 months ago
Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
Ronen Shaltiel
NOSSDAV
2009
Springer
14 years 2 months ago
Random network coding on the iPhone: fact or fiction?
In multi-hop wireless networks, random network coding represents the general design principle of transmitting random linear combinations of blocks in the same “batch” to downs...
Hassan Shojania, Baochun Li
OOPSLA
2009
Springer
14 years 2 months ago
Optimizing programs with intended semantics
Modern object-oriented languages have complex features that cause programmers to overspecify their programs. This overspecification hinders automatic optimizers, since they must ...
Daniel von Dincklage, Amer Diwan
IMC
2009
ACM
14 years 2 months ago
Characterizing VLAN-induced sharing in a campus network
Many enterprise, campus, and data-center networks have complex layer-2 virtual LANs (“VLANs”) below the IP layer. The interaction between layer-2 and IP topologies in these VL...
Muhammad Mukarram Bin Tariq, Ahmed Mansy, Nick Fea...
« Prev « First page 1114 / 1159 Last » Next »