184 search results - page 5 / 37 » Cache-oblivious data structures for orthogonal range searchi... |
CORR
2008
Springer
14 years 9 months ago
2008
Springer
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...
BMCBI
2007
14 years 9 months ago
2007
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...
78
Voted
CCCG
2008
14 years 11 months ago
2008
We consider a generalization of geometric range searching, with the goal of generating an informative "summary" of the objects contained in a query range via the applica...
151
Voted
ISNN
2011
Springer
14 years 13 days ago
2011
Springer
This paper presents a new method that uses orthogonalized features for time series clustering and classification. To cluster or classify time series data, either original data or...
ESA
2010
Springer
14 years 10 months ago
2010
Springer
As sensor networks increase in size and number, efficient techniques are required to process the very large data sets that they generate. Frequently, sensor networks monitor object...