Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

CORR
2008
Springer

favoriteEmaildiscussreport

74views Education» more CORR 2008»

Biased Range Trees

13 years 4 months ago

Biased Range Trees

Download cgm.cs.mcgill.ca

A data structure, called a biased range tree, is presented that preprocesses a set S of n points in R2 and a query distribution D for 2-sided orthogonal range counting queries. The expected query time for this data structure, when queries are drawn according to D, matches, to within a constant factor, that of the optimal decision tree for S and D. The memory and preprocessing requirements of the data structure are O(n log n).

Vida Dujmovic, John Howat, Pat Morin

Real-time Traffic

Biased Range Tree | CORR 2008 | Data Structure | Education | Query Distribution |

claim paper

Related Content

» Learning Classifiers from Imbalanced Data Based on Biased Minimax Probability Machine

» Calibration and assessment of channelspecific biases in microarray data with extended dyna...

» Lazy Bayesian Rules A Lazy SemiNaive Bayesian Learning Technique Competitive to Boosting D...

» Bias Reduction and Filter Convergence for Long Range Stereo

» Fully programmable bias current generator with 24 bit resolution per bias

» Tree Adjoining Grammars Language Bias and Genetic Programming

» Adapting Peepholing to Regression Trees

» Range Mode and Range Median Queries on Lists and Trees

» Search Bias in Constructive Metaheuristics and Implications for Ant Colony Optimisation

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2008
Where	CORR
Authors	Vida Dujmovic, John Howat, Pat Morin

Comments (0)