1192 search results - page 38 / 239 » Computing Weakest Readings |
BMCBI
2010
14 years 12 months ago
2010
Background: Finishing is the process of improving the quality and utility of draft genome sequences generated by shotgun sequencing and computational assembly. Finishing can invol...
ICTCS
2005
Springer
15 years 5 months ago
2005
Springer
We consider the fundamental problem of waking up n processors sharing a multiple access channel. We assume the weakest model of synchronization, the locally synchronous model, in ...
BIRTHDAY
2009
Springer
15 years 6 months ago
2009
Springer
Lappin and Francez (1994) present a theory of donkey anaphora which, they claim, captures both their existential and their universal readings, while maintaining a uniform represent...
119
click to vote
SIGECOM
2008
ACM
14 years 11 months ago
2008
ACM
Computer users express a strong desire to prevent attacks and to reduce the losses from computer and information security breaches. However, security compromises are common and wi...
SIGOPSE
1998
ACM
15 years 4 months ago
1998
ACM
Modern virtual machines, such as Java and Inferno, are emerging as network computing s. While these virtual machines provide higher-level abstractions and more sophisticated servi...