5153 search results - page 171 / 1031 » Introduction to Randomized Algorithms |
110
click to vote
SDM
2007
SIAM
15 years 4 months ago
2007
SIAM
We propose the use of random projections with a sparse matrix to maintain a sketch of a collection of high-dimensional data-streams that are updated asynchronously. This sketch al...
113
click to vote
CSDA
2007
15 years 3 months ago
2007
Random k-nearest-neighbour (RKNN) imputation is an established algorithm for filling in missing values in data sets. Assume that data are missing in a random way, so that missing...
100
click to vote
COMBINATORICS
2000
15 years 2 months ago
2000
It is shown in this note that with high probability it is enough to destroy all triangles in order to get a cover graph from a random graph Gn,p with p log n/n for any constant ...
124
click to vote
ATS
2000
IEEE
15 years 7 months ago
2000
IEEE
Testing of embedded cores is very difficult in SOC (system-on-a-chip), since the core user may not know the gate level implementation of the core, and the controllability and obse...
118
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Recently popularized randomized methods for principal component analysis (PCA) efficiently and reliably produce nearly optimal accuracy -- even on parallel processors -- unlike the...