9209 search results - page 246 / 1842 » Data Space Randomization |
152
click to vote
SOFSEM
2009
Springer
16 years 3 months ago
2009
Springer
This paper considers online compression algorithms that use at most polylogarithmic space (plogon). These algorithms correspond to compressors in the data stream model. We study th...
185
click to vote
SIGMETRICS
2008
ACM
15 years 6 months ago
2008
ACM
Advances in networking technology have enabled network engineers to use sampled data from routers to estimate network flow volumes and track them over time. However, low sampling ...
119
click to vote
MA
2010
Springer
15 years 4 months ago
2010
Springer
The problem of subsampling in two-sample and K-sample settings is addressed where both the data and the statistics of interest take values in general spaces. We focus on the case ...
168
click to vote
AAAI
2008
15 years 8 months ago
2008
We propose a new discriminative framework, namely Hidden Dynamic Conditional Random Fields (HDCRFs), for building probabilistic models which can capture both internal and external...
208
click to vote
INFOCOM
2011
IEEE
14 years 10 months ago
2011
IEEE
—Recent advances in virtualization technology have made it a common practice to consolidate virtual machines(VMs) into a fewer number of servers. An efficient consolidation sche...