583 search results - page 28 / 117 » Efficient algorithms for constructing decision trees with co... |
ACSC
2002
IEEE
15 years 2 months ago
2002
IEEE
Suffix trees are versatile data structures that are used for solving many string-matching problems. One of the main arguments against widespread usage of the structure is its spac...
85
Voted
DAC
2008
ACM
15 years 10 months ago
2008
ACM
In this paper, we present DeFer -- a fast, high-quality and nonstochastic fixed-outline floorplanning algorithm. DeFer generates a non-slicing floorplan by compacting a slicing fl...
NIPS
1990
14 years 11 months ago
1990
A new class of data structures called "bumptrees" is described. These structures are useful for efficiently implementing a number of neural network related operations. A...
79
Voted
STOC
2003
ACM
15 years 10 months ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
101
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
The aim of this study is to show the importance of two classification techniques, viz. decision tree and clustering, in prediction of learning disabilities (LD) of school-age chil...