Sciweavers

3396 search results - page 55 / 680
» Tree representations of graphs
Sort
View
PRICAI
2000
Springer
15 years 4 months ago
The Lumberjack Algorithm for Learning Linked Decision Forests
While the decision tree is an effective representation that has been used in many domains, a tree can often encode a concept inefficiently. This happens when the tree has to repres...
William T. B. Uther, Manuela M. Veloso
ICCBR
2003
Springer
15 years 5 months ago
Evaluation of Case-Based Maintenance Strategies in Software Design
CBR applications running in real domains can easily reach thousands of cases, which are stored in the case library. Retrieval times can increase greatly if the retrieval algorithm ...
Paulo Gomes, Francisco C. Pereira, Paulo Paiva, Nu...
104
Voted
ASPDAC
2005
ACM
105views Hardware» more  ASPDAC 2005»
15 years 2 months ago
Interconnect estimation without packing via ACG floorplans
Abstract— ACG (Adjacent Constraint Graph) is a general floorplan representation. The refinement of constraint graphs gives not only an efficient representation but also a repre...
Jia Wang, Hai Zhou
98
Voted
GD
2004
Springer
15 years 6 months ago
Really Straight Graph Drawings
We study straight-line drawings of graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2-trees, a...
Vida Dujmovic, Matthew Suderman, David R. Wood
88
Voted
COMGEO
2007
ACM
15 years 17 days ago
Drawings of planar graphs with few slopes and segments
We study straight-line drawings of planar graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2-...
Vida Dujmovic, David Eppstein, Matthew Suderman, D...