Sciweavers

7195 search results - page 1067 / 1439
» On Computing Power
Sort
View
CONCURRENCY
2010
110views more  CONCURRENCY 2010»
15 years 7 months ago
Redesigning the message logging model for high performance
Over the past decade the number of processors in the high performance facilities went up to hundreds of thousands. As a direct consequence, while the computational power follow th...
Aurelien Bouteiller, George Bosilca, Jack Dongarra
MAGS
2006
79views more  MAGS 2006»
15 years 6 months ago
Utilizing node's selfishness for providing complete anonymity in peer-to-peer based grids
In this paper, a novel protocol for providing both client and server anonymity in peer-to-peer (P2P) based grids is presented. The protocol assumes individual nodes or users to be...
Rohit Gupta, Souvik Ray, Arun K. Somani, Zhao Zhan...
ALGORITHMICA
2004
111views more  ALGORITHMICA 2004»
15 years 6 months ago
Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems
We present a framework for an automated generation of exact search tree algorithms for NP-hard problems. The purpose of our approach is two-fold--rapid development and improved up...
Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Nie...
TIT
2008
187views more  TIT 2008»
15 years 6 months ago
The Bare Bounded-Storage Model: The Tight Bound on the Storage Requirement for Key Agreement
Abstract--In the bounded-storage model (BSM) for information-theoretic secure encryption and key agreement, one makes use of a random string R whose length t is greater than the as...
Stefan Dziembowski, Ueli M. Maurer
TSP
2008
102views more  TSP 2008»
15 years 6 months ago
Bias Corrected PSD Estimation for an Adaptive Array With Moving Interference
We address the issue of computing power spectral density (PSD) estimates at the output of a beamforming sensor array in the presence of strong moving interference. It is shown that...
Brian D. Jeffs, Karl F. Warnick
« Prev « First page 1067 / 1439 Last » Next »