Sciweavers

9842 search results - page 1741 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
HPCA
2003
IEEE
16 years 4 months ago
Dynamic Data Replication: An Approach to Providing Fault-Tolerant Shared Memory Clusters
A challenging issue in today's server systems is to transparently deal with failures and application-imposed requirements for continuous operation. In this paper we address t...
Rosalia Christodoulopoulou, Reza Azimi, Angelos Bi...
CHI
2004
ACM
16 years 4 months ago
Persistence matters: making the most of chat in tightly-coupled work
How much history of the dialogue should a chat client include? Some chat clients have minimized the dialogue history to deploy the space for other purposes. A theory of conversati...
Darren Gergle, David R. Millen, Robert E. Kraut, S...
CHI
2004
ACM
16 years 4 months ago
Variation in element and action: supporting simultaneous development of alternative solutions
The complexity of many problems necessitates creating and exploring multiple, alternative solutions. However, current user interfaces do not cleanly support creating alternatives ...
Michael A. Terry, Elizabeth D. Mynatt, Kumiyo Naka...
CHI
2004
ACM
16 years 4 months ago
Safety-critical interaction: usability in incidents and accidents
Recent years have seen an increasing use of sophisticated interaction techniques in the field of command and control systems. The use of such techniques has been required in order...
Philippe A. Palanque, Floor Koornneef, Chris Johns...
POPL
2003
ACM
16 years 4 months ago
Selective memoization
We present a framework for applying memoization selectively. The framework provides programmer control over equality, space usage, and identification of precise dependences so tha...
Umut A. Acar, Guy E. Blelloch, Robert Harper
« Prev « First page 1741 / 1969 Last » Next »