Sciweavers

2252 search results - page 132 / 451
» Improving Random Forests
Sort
View
SAC
2010
ACM
14 years 3 months ago
ReSSD: a software layer for resuscitating SSDs from poor small random write performance
NAND flash-based solid state drives have emerged as revolutionary storage media during recent years. However, the wide-spread of SSD technology is currently obstructed by the fac...
Youngjae Lee, Jin-Soo Kim, Seungryoul Maeng
NOSSDAV
2009
Springer
14 years 2 months ago
Random network coding on the iPhone: fact or fiction?
In multi-hop wireless networks, random network coding represents the general design principle of transmitting random linear combinations of blocks in the same “batch” to downs...
Hassan Shojania, Baochun Li
EJC
2007
13 years 8 months ago
Deterministic random walks on the integers
Jim Propp’s P-machine, also known as the ‘rotor router model’ is a simple deterministic process that simulates a random walk on a graph. Instead of distributing chips to ran...
Joshua N. Cooper, Benjamin Doerr, Joel H. Spencer,...
ICALP
2009
Springer
14 years 8 months ago
Tight Bounds for the Cover Time of Multiple Random Walks
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the...
Robert Elsässer, Thomas Sauerwald
FOCS
2007
IEEE
14 years 2 months ago
A Primal-Dual Randomized Algorithm for Weighted Paging
In the weighted paging problem there is a weight (cost) for fetching each page into the cache. We design a randomized O(log k)-competitive online algorithm for the weighted paging...
Nikhil Bansal, Niv Buchbinder, Joseph Naor