1060 search results - page 56 / 212 » On the Discovery of Random Trees |
101
click to vote
TCAD
2002
14 years 11 months ago
2002
Interconnect optimization for VLSI circuits has received wide attention. To model routing surfaces, multiple circuit layers are freabstracted as a single rectilinear plane, ignori...
101
click to vote
ILP
2003
Springer
15 years 5 months ago
2003
Springer
We describe an efficient implementation (MRDTL-2) of the Multi-relational decision tree learning (MRDTL) algorithm [23] which in turn was based on a proposal by Knobbe et al. [19] ...
ACISICIS
2005
IEEE
15 years 1 months ago
2005
IEEE
This paper introduces a strategy and its theory proof to transform non-linear concept graph: Directed Acyclic Concept Graph (DACG) into a linear concept tree. The transformation i...
FOCS
1998
IEEE
15 years 4 months ago
1998
IEEE
We consider the parametric minimum spanning tree problem, in which we are given a graph with edge weights that are linear functions of a parameter and wish to compute the sequenc...
INEX
2009
Springer
15 years 4 months ago
2009
Springer
In the third year of the Link the Wiki track, the focus has been shifted to anchor-to-bep link discovery. The participants were encouraged to utilize different technologies to reso...