9209 search results - page 119 / 1842 » Data Space Randomization |
127
click to vote
WEA
2007
Springer
15 years 11 months ago
2007
Springer
Given a sequence S of n symbols over some alphabet Σ, we develop a new compression method that is (i) very simple to implement; (ii) provides O(1) time random access to any symbol...
JCSS
1998
15 years 4 months ago
1998
d Abstract) LYDIA E. KAVRAKI JEAN-CLAUDE LATOMBE RAJEEV MOTWANI ¡ PRABHAKAR RAGHAVAN ¢ The subject of this paper is the analysis of a randomized preprocessing scheme that ...
115
click to vote
KDD
1995
ACM
15 years 8 months ago
1995
ACM
Random errors and insufficiencies in databases limit the performance of any classifier trained from and applied to the database. In this paper we propose a method to estimate the ...
143
click to vote
CEC
2007
IEEE
15 years 11 months ago
2007
IEEE
— This paper proposes to incorporate bootstrap of data, random feature subspace and evolutionary algorithm with negative correlation learning to automatically design accurate and...
150
click to vote
SODA
2008
ACM
15 years 6 months ago
2008
ACM
Hashing is fundamental to many algorithms and data structures widely used in practice. For theoretical analysis of hashing, there have been two main approaches. First, one can ass...