5606 search results - page 244 / 1122 » Randomization Techniques for Graphs. |
192
click to vote
ISW
2010
Springer
15 years 4 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...
168
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We consider the problem of constructing an erasure code for storage over a network when the data sources are distributed. Specifically, we assume that there are n storage nodes wit...
181
click to vote
EMNLP
2010
15 years 4 months ago
2010
Existing graph-based ranking methods for keyphrase extraction compute a single importance score for each word via a single random walk. Motivated by the fact that both documents a...
150
click to vote
DCC
2008
IEEE
16 years 28 days ago
2008
IEEE
In this paper we introduce an adaptive technique for compressing small quantities of text which are organized as a rooted directed graph. We impose a constraint on the technique s...
164
click to vote
ESWS
2008
Springer
15 years 8 months ago
2008
Springer
A fundamental problem related to graph structured databases is searching for substructures. One issue with respect to optimizing such searches is the ability to estimate the freque...