1952 search results - page 150 / 391 » Complete partitions of graphs |
122
Voted
IPPS
2006
IEEE
15 years 10 months ago
2006
IEEE
This paper presents a parallel framework of grid-based numerical algorithms where data dependencies between grid zones can be modeled by a directed acyclic graph (DAG). It consist...
117
click to vote
DAC
1996
ACM
15 years 8 months ago
1996
ACM
We offer a technique to partition a centralized control-flow graph to obtain distributed control in the context of asynchronous highlevel synthesis. The technique targets Huffman-...
124
click to vote
ACL
2009
15 years 2 months ago
2009
Identifying whether a multi-word expression (MWE) is compositional or not is important for numerous NLP applications. Sense induction can partition the context of MWEs into semant...
134
Voted
ICAT
2007
IEEE
15 years 11 months ago
2007
IEEE
This study concerns the development of 3D interfaces that aid the navigation of large data structures through the usage of the HSV color space, and the ensuing “spatial framesâ€...
142
Voted
JGT
2011
14 years 11 months ago
2011
A graph G = (V, E) is called (k, k )-total weight choosable if the following holds: For any total list assignment L which assigns to each vertex x a set L(x) of k real numbers, an...