712 search results - page 72 / 143 » The Complexity of Constructing Evolutionary Trees Using Expe... |
115
click to vote
VLDB
1994
ACM
15 years 7 months ago
1994
ACM
We propose a new R-tree structure that outperforms all the older ones. The heart of the idea is to facilitate the deferred splitting approach in R-trees. This is done by proposing...
120
click to vote
ASPLOS
1987
ACM
15 years 6 months ago
1987
ACM
One potentialdisadvantage of a machine with a reduced instruction. set is that object programs may be substantially larger than those for a machine with a richer, more complex ins...
126
click to vote
KDD
2004
ACM
15 years 8 months ago
2004
ACM
In this paper, we propose a novel data mining technique for the efficient damage detection within the large-scale complex mechanical structures. Every mechanical structure is defi...
117
click to vote
TOIS
2002
15 years 2 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...
111
click to vote
GECCO
2005
Springer
15 years 8 months ago
2005
Springer
GP uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees, and GP searches t...