Sciweavers

168 search results - page 31 / 34
» Making Applications Persistent at Run-time
Sort
View
PODC
2009
ACM
14 years 7 months ago
Fast distributed random walks
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
Atish Das Sarma, Danupon Nanongkai, Gopal Panduran...
KDD
2004
ACM
213views Data Mining» more  KDD 2004»
14 years 21 days ago
Analytical view of business data
This paper describes a logical extension to Microsoft Business Framework (MBF) called Analytical View (AV). AV consists of three components: Model Service for design time, Busines...
Adam Yeh, Jonathan Tang, Youxuan Jin, Sam Skrivan
VRCAI
2009
ACM
14 years 1 months ago
Towards Virtual Reality games
Game engines of cinematic quality, broadband networking and advances in Virtual Reality (VR) technologies are setting the stage to allow players to have shared, “better-than-lif...
Andrei Sherstyuk, Dale Vincent, Anton Treskunov
EUROSYS
2008
ACM
14 years 4 months ago
Application-level isolation and recovery with solitude
When computer systems are compromised by an attack, it is difficult to determine the precise extent of the damage caused by the attack because the state changes made by an attack...
Shvetank Jain, Fareha Shafique, Vladan Djeric, Ash...
CLUSTER
2005
IEEE
14 years 29 days ago
Minimizing the Network Overhead of Checkpointing in Cycle-harvesting Cluster Environments
Cycle-harvesting systems such as Condor have been developed to make desktop machines in a local area (which are often similar to clusters in hardware configuration) available as ...
Daniel Nurmi, John Brevik, Richard Wolski