Sciweavers

17541 search results - page 138 / 3509
» Complexity in scalable computing
Sort
View
CIE
2010
Springer
15 years 8 months ago
Circuit Complexity and Multiplicative Complexity of Boolean Functions
In this note, we use lower bounds on Boolean multiplicative complexity to prove lower bounds on Boolean circuit complexity. We give a very simple proof of a 7n/3 − c lower bound ...
Arist Kojevnikov, Alexander S. Kulikov
CCGRID
2005
IEEE
15 years 9 months ago
A batch scheduler with high level components
In this article we present the design choices and the evaluation of a batch scheduler for large clusters, named OAR. This batch scheduler is based upon an original design that emp...
Nicolas Capit, Georges Da Costa, Yiannis Georgiou,...
ICASSP
2010
IEEE
15 years 3 months ago
Texas Hold 'Em algorithms for distributed compressive sensing
This paper develops a new class of algorithms for signal recovery in the distributed compressive sensing (DCS) framework. DCS exploits both intra-signal and inter-signal correlati...
Stephen R. Schnelle, Jason N. Laska, Chinmay Hegde...
125
Voted
ICDCS
2007
IEEE
15 years 9 months ago
Secure Event Dissemination in Publish-Subscribe Networks
Abstract. Content-based publish-subscribe (pub-sub) systems are an emerging paradigm for building large-scale information delivery systems. Secure event dissemination in a pub-sub ...
Mudhakar Srivatsa, Ling Liu
ICDCS
2006
IEEE
15 years 9 months ago
ASAP: an AS-Aware Peer-Relay Protocol for High Quality VoIP
Peer-to-peer (P2P) technology has been successfully applied in Internet telephony or Voice over Internet Protocol (VoIP), such as the Skype system, where P2P is used for both sear...
Shansi Ren, Lei Guo, Xiaodong Zhang