240 search results - page 16 / 48 » On Efficient Construction of Decision Trees from Large Datab... |
VLDB
2008
ACM
14 years 7 months ago
2008
ACM
Abstract Existing spatiotemporal indexes suffer from either large update cost or poor query performance, except for the Bx -tree (the state-of-the-art), which consists of multiple ...
IPMI
2005
Springer
14 years 8 months ago
2005
Springer
Abstract. In this paper, we propose an original and efficient tree matching algorithm for intra-patient hepatic vascular system registration. Vascular systems are segmented from CT...
BTW
1999
Springer
13 years 12 months ago
1999
Springer
Data mining has been recognised as an essential element of decision support, which has increasingly become a focus of the database industry. Like all computationally expensive data...
NAACL
2001
13 years 9 months ago
2001
Using finite-state automata for the text analysis component in a text-to-speech system is problematic in several respects: the rewrite rules from which the automata are compiled a...
DEXA
2008
Springer
13 years 9 months ago
2008
Springer
Properly-designed bulk-loading techniques are more efficient than the conventional tuple-loading method in constructing a multidimensional index tree for a large data set. Although...