1105 search results - page 84 / 221 » Linear choosability of graphs |
237
click to vote
ISCA
2002
IEEE
15 years 4 months ago
2002
IEEE
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
140
click to vote
ICDM
2005
IEEE
15 years 10 months ago
2005
IEEE
— Orthogonal Neighborhood Preserving Projections (ONPP) is a linear dimensionality reduction technique which attempts to preserve both the intrinsic neighborhood geometry of the ...
146
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
We relate the notion of matroid pathwidth to the minimum trellis state-complexity (which we term trellis-width) of a linear code, and to the pathwidth of a graph. By reducing from ...
136
click to vote
ICML
2005
IEEE
16 years 5 months ago
2005
IEEE
We propose a general framework for learning from labeled and unlabeled data on a directed graph in which the structure of the graph including the directionality of the edges is co...
139
click to vote
IJCNN
2007
IEEE
15 years 10 months ago
2007
IEEE
—A new interactive visualization tool is proposed for textual data mining based on bipartite graph visualization. Applications to three text datasets are presented to show the ca...