Sciweavers

675 search results - page 59 / 135
» Biased Range Trees
Sort
View
CORR
2012
Springer
188views Education» more  CORR 2012»
13 years 6 months ago
A Logical Characterization of Constraint-Based Causal Discovery
We present a novel approach to constraintbased causal discovery, that takes the form of straightforward logical inference, applied to a list of simple, logical statements about ca...
Tom Claassen, Tom Heskes
CCCG
2006
15 years 14 days ago
K-Nearest Neighbor Search using the Pyramid Technique
A k-nearest neighbor search algorithm for the Pyramid technique is presented. The Pyramid technique divides d-dimensional data space into 2d pyramids. Given a query point q, we in...
Bradford G. Nickerson, Qingxiu Shi
BMCBI
2007
99views more  BMCBI 2007»
14 years 11 months ago
Orthogonal projections to latent structures as a strategy for microarray data normalization
Background: During generation of microarray data, various forms of systematic biases are frequently introduced which limits accuracy and precision of the results. In order to prop...
Max Bylesjö, Daniel Eriksson, Andreas Sjö...
CORR
2011
Springer
188views Education» more  CORR 2011»
14 years 6 months ago
Towards Unbiased BFS Sampling
Abstract—Breadth First Search (BFS) is a widely used approach for sampling large unknown Internet topologies. Its main advantage over random walks and other exploration technique...
Maciej Kurant, Athina Markopoulou, Patrick Thiran
BMCBI
2011
14 years 6 months ago
iPhy: an integrated phylogenetic workbench for supermatrix analyses
Background: The increasing availability of molecular sequence data means that the accuracy of future phylogenetic studies is likely to by limited by systematic bias and taxon choi...
Martin O. Jones, Georgios D. Koutsovoulos, Mark L....