1221 search results - page 133 / 245 » Balanced graph partitioning |
DAC
1996
ACM
14 years 2 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-...
GC
2006
Springer
13 years 10 months ago
2006
Springer
An n-partite tournament is an orientation of a complete n-partite graph. An npartite tournament is a tournament, if it contains exactly one vertex in each partite set. Douglas, Pr...
ACL
2009
13 years 8 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...
ICAT
2007
IEEE
14 years 4 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â€...
CVPR
2011
IEEE
13 years 1 months ago
2011
IEEE
We propose a new objective function for superpixel segmentation. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term....