Sciweavers

330 search results - page 21 / 66
» On the Notion of Pseudo-Free Groups
Sort
View
SODA
2010
ACM
169views Algorithms» more  SODA 2010»
15 years 8 months ago
Efficiently Decodable Non-adaptive Group Testing
We consider the following "efficiently decodable" nonadaptive group testing problem. There is an unknown string x {0, 1}n with at most d ones in it. We are allowed to t...
Piotr Indyk, Hung Q. Ngo, Atri Rudra
STOC
2003
ACM
90views Algorithms» more  STOC 2003»
15 years 11 months ago
Work-competitive scheduling for cooperative computing with dynamic groups
The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distrib...
Chryssis Georgiou, Alexander Russell, Alexander A....
ISWC
1999
IEEE
15 years 3 months ago
When Cyborgs Meet: Building Communities of Cooperating Wearable Agents
This paper introduces the notion of a Wearable Community as a group of wearable users who cooperate for their mutual benefit. In such a community, wearable computers act as person...
Gerd Kortuem, Jay Schneider, Jim Suruda, Stephen F...
HUC
1999
Springer
15 years 3 months ago
Close Encounters: Supporting Mobile Collaboration through Interchange of User Profiles
This paper introduces the notion of profile-based cooperation as a way to support awareness and informal communication between mobile users during chance encounters. We describe th...
Gerd Kortuem, Zary Segall, Thaddeus G. Cowan Thomp...
ESOP
1994
Springer
15 years 3 months ago
Dimension Types
Scientists and engineers must ensure that physical equations are dimensionally consistent, but existing programming languages treat all numeric values as dimensionless. This paper ...
Andrew Kennedy