3020 search results - page 210 / 604 » Optimal partition trees |
207
click to vote
WAW
2010
Springer
15 years 4 months ago
2010
Springer
We give algorithms for finding graph clusters and drawing graphs, highlighting local community structure within the context of a larger network. For a given graph G, we use the per...
152
click to vote
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
We propose a modified discrete HMM that includes a feature weighting discrimination component. We assume that the feature space is partitioned into subspaces and that the relevan...
184
click to vote
FPL
2000
Springer
15 years 10 months ago
2000
Springer
As integration levels in FPGA devices have increased over the past decade, the structure of programmable logic resources has become more diversified. Recently, Altera Corporation h...
166
click to vote
GRAPHICSINTERFACE
2007
15 years 8 months ago
2007
This paper describes a new tool for preprocessed visibility. It puts together view space and object space partitioning in order to control the render cost and memory cost of the v...
147
click to vote
ISAAC
2005
Springer
16 years 3 days ago
2005
Springer
We study how to label the vertices of a tree in such a way that we can decide the distance of two vertices in the tree given only their labels. For trees, Gavoille et al. [7] prove...