Sciweavers

5608 search results - page 851 / 1122
» On the Theory of Matchgate Computations
Sort
View
MOBIHOC
2008
ACM
16 years 6 months ago
Construction algorithms for k-connected m-dominating sets in wireless sensor networks
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
Yiwei Wu, Yingshu Li
MOBIHOC
2002
ACM
16 years 6 months ago
On the minimum node degree and connectivity of a wireless multihop network
This paper investigates two fundamental characteristics of a wireless multihop network: its minimum node degree and its k?connectivity. Both topology attributes depend on the spat...
Christian Bettstetter
TLDI
2010
ACM
190views Formal Methods» more  TLDI 2010»
16 years 3 months ago
Distributed programming with distributed authorization
We propose a programming language, called PCML5, for building distributed applications with distributed access control. Target applications include web-based systems in which prog...
Kumar Avijit, Anupam Datta, Robert Harper
CSCW
2010
ACM
16 years 3 months ago
What's it worth to you?: the costs and affordances of CMC tools to asian and american users
In recent years, a growing number of studies examining how culture shapes computer-mediated communication (CMC) have appeared in the CHI and CSCW literature. Findings from these s...
Leslie D. Setlock, Susan R. Fussell
PLDI
2009
ACM
16 years 1 months ago
A weakest precondition approach to active attacks analysis
Information flow controls can be used to protect both data confidentiality and data integrity. The certification of the security degree of a program that runs in untrusted envi...
Musard Balliu, Isabella Mastroeni