2020 search results - page 19 / 404 » Speeding up Slicing |
PAKDD
2005
ACM
14 years 29 days ago
2005
ACM
In several contexts and domains, hierarchical agglomerative clustering (HAC) offers best-quality results, but at the price of a high complexity which reduces the size of datasets ...
PKDD
2005
Springer
14 years 29 days ago
2005
Springer
Logistic Model Trees have been shown to be very accurate and compact classifiers [8]. Their greatest disadvantage is the computational complexity of inducing the logistic regressi...
WEA
2005
Springer
14 years 29 days ago
2005
Springer
MSWIM
2004
ACM
14 years 28 days ago
2004
ACM
Mobile ad-hoc networks (MANETs) present quite large packet loss bursts due to mobility. In this work we propose two models based on hidden Markov models for estimating packet arri...
EDBT
2004
ACM
14 years 27 days ago
2004
ACM
Abstract. We present a cost-based adaptive clustering method to improve average performance of spatial queries (intersection, containment, enclosure queries) over large collections...