285 search results - page 20 / 57 » New Ways to Construct Binary Search Trees |
126
click to vote
GECCO
2009
Springer
15 years 6 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
ISCAS
1995
IEEE
15 years 3 months ago
1995
IEEE
In this paper, we present a new clock routing algorithm which minimizes total wirelength under any given path-length skew bound. The algorithm constructs a bounded-skew tree (BST)...
109
click to vote
KDD
2000
ACM
15 years 3 months ago
2000
ACM
Decision trees have been successfully used for the task of classification. However, state-of-the-art algorithms do not incorporate the user in the tree construction process. This ...
EVOW
2009
Springer
15 years 6 months ago
2009
Springer
Image filtering involves taking a digital image and producing a new image from it. In software packages such as Adobe’s Photoshop, image filters are used to produce artistic ve...
PASTE
1998
ACM
15 years 4 months ago
1998
ACM
Concept analysis transforms any relation between ‘lobjects” and “attributes” into a complete lattice. This concept lattice can be studied by algebraic means and offers rem...