12193 search results - page 2202 / 2439 » It's not all about |
152
click to vote
MOBIHOC
2003
ACM
16 years 6 months ago
2003
ACM
Contrary to the common belief that mobility makes security more difficult to achieve, we show that node mobility can, in fact, be useful to provide security in ad hoc networks. We...
169
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...
159
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
We consider the following model for fire containment. We are given an undirected graph G = (V, E) with a source vertex s where the fire starts. At each time step, the firefighters...
172
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
There has been great interest in deciding whether a combinatorial structure satisfies some property, or in estimating the value of some numerical function associated with this com...
192
click to vote
ICDT
2010
ACM
16 years 4 months ago
2010
ACM
The work reported here lays the foundations of data exchange in the presence of probabilistic data. This requires rethinking the very basic concepts of traditional data exchange, ...