803 search results - page 103 / 161 » Independence in Direct-Product Graphs |
125
Voted
PPOPP
2006
ACM
15 years 6 months ago
2006
ACM
Performance analysis tools are critical for the effective use of large parallel computing resources, but existing tools have failed to address three problems that limit their scal...
80
Voted
COMBINATORICA
2007
15 years 25 days ago
2007
The k-th power of a graph G is the graph whose vertex set is V (G)k , where two distinct ktuples are adjacent iff they are equal or adjacent in G in each coordinate. The Shannon ...
107
click to vote
ICML
2009
IEEE
16 years 1 months ago
2009
IEEE
Recent work has shown that one can learn the structure of Gaussian Graphical Models by imposing an L1 penalty on the precision matrix, and then using efficient convex optimization...
112
Voted
ICCD
2003
IEEE
15 years 9 months ago
2003
IEEE
Functional symmetries provide significant benefits for multiple tasks in synthesis and verification. Many applications require the manual specification of symmetries using spe...
106
Voted
WALCOM
2010
IEEE
15 years 7 months ago
2010
IEEE
Abstract. Directed graphs are commonly drawn by the Sugiyama algorithm, where crossing reduction is a crucial phase. It is done by repeated one-sided 2-level crossing minimizations...