Sciweavers

3937 search results - page 493 / 788
» Questioning Ubiquitous Computing
Sort
View
FCT
2003
Springer
15 years 11 months ago
Operations Preserving Recognizable Languages
Abstract. Given a subset S of N, filtering a word a0a1 · · · an by S consists in deleting the letters ai such that i is not in S. By a natural generalization, denote by L[S], w...
Jean Berstel, Luc Boasson, Olivier Carton, Bruno P...
FORMATS
2003
Springer
15 years 11 months ago
Folk Theorems on the Determinization and Minimization of Timed Automata
Timed automata are known not to be complementable or determinizable. Natural questions are, then, could we check whether a given TA enjoys these properties? These problems are not...
Stavros Tripakis
IPTPS
2003
Springer
15 years 11 months ago
Understanding Availability
This paper addresses a simple, yet fundamental question in the design of peer-to-peer systems: What does it mean when we say “availability” and how does this understanding imp...
Ranjita Bhagwan, Stefan Savage, Geoffrey M. Voelke...
TAMC
2010
Springer
15 years 11 months ago
A Note on the Testability of Ramsey's Class
Abstract. In property testing, the goal is to distinguish between objects that satisfy some desirable property and objects that are far from satisfying it, after examining only a s...
Charles Jordan, Thomas Zeugmann
CSCW
2000
ACM
15 years 11 months ago
Coordination of communication: effects of shared visual context on collaborative work
We outline some of the benefits of shared visual information for collaborative repair tasks and report on a study comparing collaborative performance on a manual task by workers a...
Susan R. Fussell, Robert E. Kraut, Jane Siegel