Sciweavers

1209 search results - page 60 / 242
» Universal Algebra and Computer Science
Sort
View
PODC
2012
ACM
11 years 11 months ago
Weak models of distributed computing, with connections to modal logic
This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and we study models of computing that are weaker ve...
Lauri Hella, Matti Järvisalo, Antti Kuusisto,...
IPL
2006
110views more  IPL 2006»
13 years 8 months ago
Variationally universal hashing
The strongest well-known measure for the quality of a universal hash-function family H is its being -strongly universal, which measures, for randomly chosen h H, one's inabi...
Ted Krovetz, Phillip Rogaway
CHI
2009
ACM
14 years 9 months ago
Cell phone software aiding name recall
Senior citizens often find it difficult to remember names. This paper describes a novel cell phone application that uses information about one's social network and the places...
Kent Fenwick, Michael Massimi, Ronald Baecker, San...
AC
1999
Springer
14 years 1 months ago
The University Student Registration System: A Case Study in Building a High-Availability Distributed Application Using General P
Prior to 1994, student registration at Newcastle University involved students being registered in a single place, where they would present a form which had previously been filled ...
Mark C. Little, Stuart M. Wheater, David B. Ingham...
ACMSE
2006
ACM
14 years 2 months ago
Using an end-to-end demonstration in an undergraduate grid computing course
In this paper, we describe a demonstration called an “End-to-End” demonstration developed for the 2005 offering of our grid computing course that was taught across the State o...
Mark A. Holliday, Barry Wilkinson, James Ruff