Sciweavers

164 search results - page 1 / 33
» The Future Is Parallel But It May Not Be Easy
Sort
View
HPDC
2007
IEEE
13 years 10 months ago
How CN and P2P technologies may help build next-generation grids
With the evolution of technology, Grids cannot be considered any more solely as a federation of a modest number of powerful cluster computers. Trends show that future Grids will i...
Guillaume Pierre
COCO
2005
Springer
123views Algorithms» more  COCO 2005»
13 years 9 months ago
If NP Languages are Hard on the Worst-Case Then It is Easy to Find Their Hard Instances
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma
CC
2007
Springer
121views System Software» more  CC 2007»
13 years 3 months ago
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma
CLOUDCOM
2010
Springer
13 years 1 months ago
An Interface Design for Future Cloud-Based Visualization Services
The pervasive concept of cloud computing suggests that visualization, which is both data and computing intensive, is a perfect cloud computing application. This paper presents a s...
Yuzuru Tanahashi, Cheng-Kai Chen, Stephane Marches...