405 search results - page 26 / 81 » Efficient decision tree construction on streaming data |
112
click to vote
BIRD
2007
Springer
15 years 10 months ago
2007
Springer
We investigate indexing techniques for sequence data, crucial in a wide variety of applications, where efficient, scalable, and versatile search algorithms are required. Recent res...
140
click to vote
CITA
2005
IEEE
15 years 10 months ago
2005
IEEE
- We present an architecture for data streams based on structures typically found in web cache hierarchies. The main idea is to build a meta level analyser from a number of levels ...
162
click to vote
EGH
2010
Springer
15 years 2 months ago
2010
Springer
The k-D tree is a well-studied acceleration data structure for ray tracing. It is used to organize primitives in a scene to allow efficient execution of intersection operations be...
149
click to vote
NLP
2000
15 years 8 months ago
2000
In this article we compare the performance of various machine learning algorithms on the task of constructing word-sense disambiguation rules from data. The distinguishing characte...
126
click to vote
TOIS
2002
15 years 4 months ago
2002
Many applications depend on efficient management of large sets of distinct strings in memory. For example, during index construction for text databases a record is held for each d...