3616 search results - page 413 / 724 » Conditional Memory Ordering |
141
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
We address here two major challenges presented by dynamic data mining: 1) the stability challenge: we have implemented a rigorous incremental density-based clustering algorithm, i...
130
click to vote
ENTCS
2008
15 years 3 months ago
2008
Defence trees are used to represent attack and defence strategies in security scenarios; the aim in such scenarios is to select the best set of countermeasures that are able to st...
118
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
The cross-entropy method (CE) developed by R. Rubinstein is an elegant practical principle for simulating rare events. The method approximates the probability of the rare event by...
125
Voted
DM
2006
15 years 3 months ago
2006
A graph is called almost self-complementary if it is isomorphic to one of its almost complements Xc - I, where Xc denotes the complement of X and I a perfect matching (1-factor) i...
149
click to vote
IJCSA
2006
15 years 3 months ago
2006
Analysis of the effect of different parameters of the RC4 encryption algorithm where examined. Some experimental work was performed to illustrate the performance of this algorithm...