2252 search results - page 420 / 451 » Improving Random Forests |
162
click to vote
MMSEC
2004
ACM
15 years 11 months ago
2004
ACM
In this paper, we introduce a new approach to passive-warden steganography in which the sender embeds the secret message into a certain subset of the cover object without having t...
185
click to vote
MOBIHOC
2004
ACM
15 years 11 months ago
2004
ACM
In this work, we develop an analytical framework to investigate the behavior of the communication links of a node in a random mobility environment. Analytical expressions characte...
146
click to vote
SIGMETRICS
2004
ACM
15 years 11 months ago
2004
ACM
Measurement studies indicate a high rate of node dynamics in p2p systems. In this paper, we address the question of how high a rate of node dynamics can be supported by structured...
133
click to vote
CPM
2004
Springer
15 years 11 months ago
2004
Springer
Given a set S = {s1, s2, . . . , sn} of strings each of length m, and an integer L, we study the following two problems. k-Closest Substring problem: find k center strings c1, c2,...
149
click to vote
GECCO
2004
Springer
15 years 11 months ago
2004
Springer
Using a directed mutation can improve the efficiency of processing many optimization problems. The first mutation operators of this kind proposed by Hildebrand [1], however, suffer...