Sciweavers

2479 search results - page 461 / 496
» A Computational Theory of Working Memory
Sort
View
SAC
2010
ACM
14 years 3 months ago
Adaptive internet services through performance and availability control
Cluster-based multi-tier systems provide a means for building scalable Internet services. Building adaptive Internet services that are able to apply appropriate system sizing and ...
Jean Arnaud, Sara Bouchenak
ICS
2009
Tsinghua U.
14 years 3 months ago
MPI-aware compiler optimizations for improving communication-computation overlap
Several existing compiler transformations can help improve communication-computation overlap in MPI applications. However, traditional compilers treat calls to the MPI library as ...
Anthony Danalis, Lori L. Pollock, D. Martin Swany,...
FOCS
2009
IEEE
14 years 3 months ago
Agnostic Learning of Monomials by Halfspaces Is Hard
— We prove the following strong hardness result for learning: Given a distribution on labeled examples from the hypercube such that there exists a monomial (or conjunction) consi...
Vitaly Feldman, Venkatesan Guruswami, Prasad Ragha...
INFOCOM
2009
IEEE
14 years 3 months ago
Null Keys: Limiting Malicious Attacks Via Null Space Properties of Network Coding
—The performance of randomized network coding can suffer significantly when malicious nodes corrupt the content of the exchanged blocks. Previous work have introduced error corr...
Elias Kehdi, Baochun Li
COCO
2009
Springer
106views Algorithms» more  COCO 2009»
14 years 3 months ago
Improved Approximation of Linear Threshold Functions
We prove two main results on how arbitrary linear threshold functions f(x) = sign(w · x − θ) over the n-dimensional Boolean hypercube can be approximated by simple threshold f...
Ilias Diakonikolas, Rocco A. Servedio