Sciweavers

251 search results - page 47 / 51
» When Size Does Matter
Sort
View
ICPP
1993
IEEE
13 years 11 months ago
Scalability Study of the KSR-1
Scalability of parallel architectures is an interesting area of current research. Shared memory parallel programming is attractive stemming from its relative ease in transitioning...
Umakishore Ramachandran, Gautam Shah, Ravi Kumar, ...
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
13 years 11 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek
CCS
2000
ACM
13 years 11 months ago
PRUNES: an efficient and complete strategy for automated trust negotiation over the Internet
The Internet provides an environment where two parties, who are virtually strangers to each other, can make connections and do business together. Before any actual business starts...
Ting Yu, Xiaosong Ma, Marianne Winslett
USENIX
2007
13 years 9 months ago
Virtual Machine Memory Access Tracing with Hypervisor Exclusive Cache
Virtual machine (VM) memory allocation and VM consolidation can benefit from the prediction of VM page miss rate at each candidate memory size. Such prediction is challenging for...
Pin Lu, Kai Shen
NIPS
2007
13 years 8 months ago
Fixing Max-Product: Convergent Message Passing Algorithms for MAP LP-Relaxations
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
Amir Globerson, Tommi Jaakkola