Sciweavers

333 search results - page 6 / 67
» Computation with Absolutely No Space Overhead
Sort
View
ICALP
1994
Springer
14 years 2 months ago
On the Cost of Recomputing: Tight Bounds on Pebbling with Faults
We introduce a formal framework to study the time and space complexity of computing with faulty memory. For the fault-free case, time and space complexities were studied using the...
Yonatan Aumann, Judit Bar-Ilan, Uriel Feige
IMCS
2007
144views more  IMCS 2007»
13 years 10 months ago
On the imbalance of the security problem space and its expected consequences
Purpose – This paper aims to report on the results of an analysis of the computer security problem space, to suggest the areas with highest potential for making progress in the ...
Konstantin Beznosov, Olga Beznosova
PPNA
2010
71views more  PPNA 2010»
13 years 8 months ago
SPACE: A lightweight collaborative caching for clusters
In this paper, we introduce Systematic P2P Aided Cache Enhancement or SPACE, a new collaboration scheme among clients in a computer cluster of a high performance computing facility...
Mohammad Mursalin Akon, Mohammad Towhidul Islam, X...
HAPTICS
2002
IEEE
14 years 2 months ago
Autostereoscopic and Haptic Visualization for Space Exploration and Mission Design
We have developed a multi-modal virtual environment set-up by fusing visual and haptic images through the use of a new autostereoscopic display and a force-feedback haptic device....
Cagatay Basdogan, Mitchell J. H. Lum, Jose Salcedo...
IJRR
2007
104views more  IJRR 2007»
13 years 10 months ago
Deep Space Formation Flying Spacecraft Path Planning
Efficient algorithms for collision-free energy sub-optimal path planning for formations of spacecraft flying in deep space are presented. The idea is to introduce a set of way-poi...
Cornel Sultan, Sanjeev Seereeram, Raman K. Mehra