2705 search results - page 386 / 541 » Splitting the sensor node |
177
click to vote
APPROX
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
143
click to vote
DBA
2006
15 years 5 months ago
2006
We present a scalable distributed database system SD-SQL Server. Its original feature is the scalable distributed partitioning of its relational tables. The system dynamically dist...
169
click to vote
ALENEX
2001
15 years 5 months ago
2001
In nearest neighbor searching we are given a set of n data points in real d-dimensional space, d , and the problem is to preprocess these points into a data structure, so that give...
139
click to vote
APVIS
2001
15 years 5 months ago
2001
Traditional graph drawing is only concerned with viewing of data and relations amount data items. It uses a graph model to present the data items and the relations and tries to ca...
121
click to vote
JDWM
2007
15 years 4 months ago
2007
This article presents a new evolutionary algorithm (EA) for induction of mixed decision trees. In nonterminal nodes of a mixed tree, different types of tests can be placed, rangin...