4218 search results - page 272 / 844 » Complete sets of cooperations |
115
Voted
EJC
2008
14 years 11 months ago
2008
For a graph G and a set D V (G), define Nr[x] = {xi V (G) : d(x, xi) r} (where d(x, y) is graph theoretic distance) and Dr(x) = Nr[x] D. D is known as an r-identifying code if...
118
click to vote
ISW
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. Instruction Set Randomization (ISR) is a promising technique for preventing code-injection attacks. In this paper we present a complete randomization framework for JavaSc...
111
Voted
ARC
2011
Springer
14 years 7 months ago
2011
Springer
Abstract. In this paper, we take a MIPS-based open-source uniprocessor soft core, Plasma, and extend it to obtain the Beefarm infrastructure for FPGA-based multiprocessor emulation...
151
Voted
FORTE
2011
14 years 4 months ago
2011
We present a new, streamlined language of global types equipped with a trace-based semantics and whose features and restrictions are semantically justified. The multi-party sessio...
190
Voted
ICDT
2009
ACM
16 years 1 months ago
2009
ACM
Almost all medium- and large-scale businesses rely on electronic workflow systems to manage their business processes. A key challenge is to enable the easy re-use and modification...