921 search results - page 5 / 185 » New Data Structures for Orthogonal Range Searching |
BMCBI
2007
13 years 7 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...
ICALP
1999
Springer
13 years 11 months ago
1999
Springer
The data sets for many of today's computer applications are too large to t within the computer's internal memory and must instead be stored on external storage devices su...
STACS
2012
Springer
12 years 3 months ago
2012
Springer
A mode of a multiset S is an element a ∈ S of maximum multiplicity; that is, a occurs at least as frequently as any other element in S. Given an array A[1 : n] of n elements, we...
ISNN
2011
Springer
12 years 10 months 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...
EDBT
2012
ACM
11 years 9 months ago
2012
ACM
The range searching problem is fundamental in a wide spectrum of applications such as radio frequency identification (RFID) networks, location based services (LBS), and global po...