Sciweavers

248 search results - page 13 / 50
» A Simple Optimal Randomized Algorithm for Sorting on the PDM
Sort
View
DASFAA
2011
IEEE
250views Database» more  DASFAA 2011»
12 years 11 months ago
An FTL-Agnostic Layer to Improve Random Write on Flash Memory
Flash memories are considered a competitive alternative to rotating disks as non-volatile data storage for database management systems. However, even if the Flash Translation Layer...
Brice Chardin, Olivier Pasteur, Jean-Marc Petit
STOC
2007
ACM
111views Algorithms» more  STOC 2007»
14 years 8 months ago
Low-end uniform hardness vs. randomness tradeoffs for AM
In 1998, Impagliazzo and Wigderson [IW98] proved a hardness vs. randomness tradeoff for BPP in the uniform setting, which was subsequently extended to give optimal tradeoffs for t...
Ronen Shaltiel, Christopher Umans
GECCO
2004
Springer
14 years 1 months ago
Self Adaptation of Operator Rates in Evolutionary Algorithms
Abstract. This work introduces a new evolutionary algorithm that adapts the operator probabilities (rates) while evolves the solution of the problem. Each individual encodes its ge...
Jonatan Gomez
RECOMB
2008
Springer
14 years 8 months ago
Hurdles Hardly Have to Be Heeded
Abstract. As data about genomic architecture accumulates, genomic rearrangements have attracted increasing attention. One of the main rearrangement mechanisms, inversions (also cal...
Krister M. Swenson, Yu Lin, Vaibhav Rajan, Bernard...
ECML
2006
Springer
13 years 11 months ago
Combinatorial Markov Random Fields
Abstract. A combinatorial random variable is a discrete random variable defined over a combinatorial set (e.g., a power set of a given set). In this paper we introduce combinatoria...
Ron Bekkerman, Mehran Sahami, Erik G. Learned-Mill...