Sciweavers

675 search results - page 17 / 135
» Biased Range Trees
Sort
View
86
Voted
ANCS
2009
ACM
14 years 8 months ago
Range Tries for scalable address lookup
In this paper we introduce the Range Trie, a new multiway tree data structure for address lookup. Each Range Trie node maps to an address range [Na, Nb) and performs multiple comp...
Ioannis Sourdis, Georgios Stefanakis, Ruben de Sme...
WSC
2000
15 years 5 days ago
A comparison of five steady-state truncation heuristics for simulation
We compare the performance of five well-known truncation heuristics for mitigating the effects of initialization bias in the output analysis of steady-state simulations. Two of th...
K. Preston White, Michael J. Cobb, Stephen C. Spra...
BMCBI
2010
165views more  BMCBI 2010»
14 years 11 months ago
Filtering, FDR and power
Background: In high-dimensional data analysis such as differential gene expression analysis, people often use filtering methods like fold-change or variance filters in an attempt ...
Maarten van Iterson, Judith M. Boer, Renée ...
COMPGEOM
2010
ACM
15 years 3 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
GPEM
2002
145views more  GPEM 2002»
14 years 10 months ago
An Analysis of the Causes of Code Growth in Genetic Programming
Abstract. This research examines the cause of code growth (bloat) in genetic programming (GP). Currently there are three hypothesized causes of code growth in GP: protection, drift...
Terence Soule, Robert B. Heckendorn