20807 search results - page 228 / 4162 » How to read a paper |
170
click to vote
POPL
2010
ACM
16 years 4 months ago
2010
ACM
We address the verification problem of finite-state concurrent programs running under weak memory models. These models capture the reordering of program (read and write) operation...
149
click to vote
WDAG
2005
Springer
16 years 5 days ago
2005
Springer
This paper presents lower bounds on the time- and space-complexity of implementations that use the k compare-and-swap (k-CAS) synchronization primitives. We prove that the use of ...
179
click to vote
VLDB
2004
ACM
16 years 1 days ago
2004
ACM
Declarative queries are proving to be an attractive paradigm for interacting with networks of wireless sensors. The metaphor that “the sensornet is a database” is problematic,...
213
click to vote
XMLSEC
2003
ACM
15 years 12 months ago
2003
ACM
As a large quantity of information is presented in XML format on the Web, there are increasing demands for XML security. Until now, research on XML security has been focused on th...
157
click to vote
IPCC
1998
15 years 8 months ago
1998
: Internet-based distance learning programs make it possible for technical communicators located anywhere in the world to participate in graduate courses in their field. But are th...