921 search results - page 65 / 185 » New Data Structures for Orthogonal Range Searching |
128
click to vote
KDD
2001
ACM
16 years 4 months ago
2001
ACM
This paper is concerned with the construction of regression and classification trees that are more adapted to data mining applications than conventional trees. To this end, we pro...
158
click to vote
KDD
2002
ACM
16 years 4 months ago
2002
ACM
Instance selection and feature selection are two orthogonal methods for reducing the amount and complexity of data. Feature selection aims at the reduction of redundant features i...
112
click to vote
PR
2007
15 years 3 months ago
2007
Classical clustering algorithms are based on the concept that a cluster center is a single point. Clusters which are not compact around a single point are not candidates for class...
138
click to vote
BMCBI
2010
15 years 4 months ago
2010
Background: New technologies are enabling the measurement of many types of genomic and epigenomic information at scales ranging from the atomic to nuclear. Much of this new data i...
167
click to vote
MST
2006
15 years 4 months ago
2006
Load balancing is a critical issue for the efficient operation of peerto-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a...