Sciweavers

463 search results - page 64 / 93
» The Most Reliable Subgraph Problem
Sort
View
120
Voted
IUI
2009
ACM
15 years 10 months ago
You can play that again: exploring social redundancy to derive highlight regions in videos
Identifying highlights in multimedia content such as video and audio is currently a very difficult technical problem. We present and evaluate a novel algorithm that identifies hig...
Jose San Pedro, Vaiva Kalnikaité, Steve Whi...
CSCW
2010
ACM
15 years 10 months ago
Gone but not forgotten: designing for disconnection in synchronous groupware
Synchronous groupware depends on the assumption that people are fully connected to the others in the group, but there are many situations (network delay, network outage, or explic...
Carl Gutwin, T. C. Nicholas Graham, Christopher Wo...
SC
2009
ACM
15 years 8 months ago
Supporting fault-tolerance for time-critical events in distributed environments
In this paper, we consider the problem of supporting fault tolerance for adaptive and time-critical applications in heterogeneous and unreliable grid computing environments. Our g...
Qian Zhu, Gagan Agrawal
ATAL
2009
Springer
15 years 8 months ago
Evolutionary testing of autonomous software agents
A system built in terms of autonomous agents may require even greater correctness assurance than one which is merely reacting to the immediate control of its users. Agents make su...
Cu D. Nguyen, Anna Perini, Paolo Tonella, Simon Mi...
110
Voted
ICCS
2009
Springer
15 years 8 months ago
Balancing Scientist Needs and Volunteer Preferences in Volunteer Computing Using Constraint Optimization
BOINC is a middleware for Volunteer Computing. In BOINC projects, heterogeneous resources distributed across the Internet are used for large-scale scientific simulations. The larg...
James Atlas, Trilce Estrada, Keith Decker, Michela...