2635 search results - page 53 / 527 » Algorithms for the Database Layout Problem |
107
click to vote
ISCC
2006
IEEE
15 years 8 months ago
2006
IEEE
Rectangular dualization is an effective, hierarchically oriented visualization method for network topologies and can be used in many other problems having in common with networks ...
132
Voted
GD
2004
Springer
15 years 8 months ago
2004
Springer
Large graphs are difficult to browse and to visually explore. This note adds up evidence that some graph drawing techniques, which produce readable layouts when applied to medium-s...
112
Voted
ACL
2007
15 years 4 months ago
2007
We examine the problem of choosing word order for a set of dependency trees so as to minimize total dependency length. We present an algorithm for computing the optimal layout of ...
119
click to vote
PODS
2008
ACM
16 years 2 months ago
2008
ACM
Co-clustering is the simultaneous partitioning of the rows and columns of a matrix such that the blocks induced by the row/column partitions are good clusters. Motivated by severa...
118
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
Consider a set of labels L and a set of trees T = {T (1) , T (2) , . . . , T (k) } where each tree T (i) is distinctly leaf-labeled by some subset of L. One fundamental problem is ...