9209 search results - page 105 / 1842 » Data Space Randomization |
145
click to vote
ILP
2004
Springer
15 years 10 months ago
2004
Springer
Random forest induction is a bagging method that randomly samples the feature set at each node in a decision tree. In propositional learning, the method has been shown to work well...
135
click to vote
ICML
2004
IEEE
16 years 5 months ago
2004
IEEE
Conditional Random Fields (CRFs; Lafferty, McCallum, & Pereira, 2001) provide a flexible and powerful model for learning to assign labels to elements of sequences in such appl...
147
click to vote
ISCIS
2005
Springer
15 years 10 months ago
2005
Springer
Dense subgraphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Computing them however is generally expe...
127
click to vote
SSC
2007
Springer
15 years 11 months ago
2007
Springer
Any span n sequences can be regarded as filtering sequences. From this observation, new randomness criteria for span n sequences are proposed. It is proved that the feedback funct...
131
click to vote
PCM
2001
Springer
15 years 9 months ago
2001
Springer
In a digital multimedia era, the security of multimedia over network transmission becomes a challenging issue. A strategy, combining cryptography with steganography, is investigat...