Sciweavers

5606 search results - page 124 / 1122
» Randomization Techniques for Graphs.
Sort
View
DEXA
2009
Springer
138views Database» more  DEXA 2009»
14 years 5 months ago
Evaluating Non-In-Place Update Techniques for Flash-Based Transaction Processing Systems
Recently, flash memory is emerging as the storage device. With price sliding fast, the cost per capacity is approaching to that of SATA disk drives. So far flash memory has been ...
Yongkun Wang, Kazuo Goda, Masaru Kitsuregawa
STACS
2009
Springer
14 years 5 months ago
A Comparison of Techniques for Sampling Web Pages
As the World Wide Web is growing rapidly, it is getting increasingly challenging to gather representative information about it. Instead of crawling the web exhaustively one has to...
Eda Baykan, Monika Rauch Henzinger, Stefan F. Kell...
ACG
2006
Springer
14 years 4 months ago
Move-Pruning Techniques for Monte-Carlo Go
Abstract. Progressive Pruning (PP) is used in the Monte-Carlo go playing program Indigo. For each candidate move, PP launches random games starting with this move. PP gathers stati...
Bruno Bouzy
ESORICS
2008
Springer
13 years 11 months ago
On the Impact of User Movement Simulations in the Evaluation of LBS Privacy- Preserving Techniques
The evaluation of privacy-preserving techniques for LBS is often based on simulations of mostly random user movements that only partially capture real deployment scenarios. We clai...
Sergio Mascetti, Dario Freni, Claudio Bettini, Xia...
ICALP
2009
Springer
14 years 5 months ago
Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
Abstract Randomized rumor spreading is an efficient protocol to distribute information in networks. Recently, a quasirandom version has been proposed and proven to work equally we...
Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald