2314 search results - page 229 / 463 » Minimal Partitions of a Graph |
122
click to vote
ESOP
2010
Springer
16 years 1 months ago
2010
Springer
Detailed memory models that expose individual fields are necessary to precisely analyze code that makes use of low-level aspects such as, pointers to fields and untagged unions. Ye...
130
click to vote
ICIP
2007
IEEE
15 years 10 months ago
2007
IEEE
The geometric features of images, such as edges, are difficult to represent. When a redundant transform is used for their extraction, the compression challenge is even more dif...
142
click to vote
ICCAD
1999
IEEE
15 years 8 months ago
1999
IEEE
In this paper, we present a new approach to the problem of inverter elimination in domino logic synthesis. A small piece of static CMOS logic is introduced to the circuit to avoid...
134
click to vote
SODA
2004
ACM
15 years 5 months ago
2004
ACM
Given a graph G and a spanning tree T of G, we say that T is a tree t-spanner of G if the distance between every pair of vertices in T is at most t times their distance in G. The p...
132
click to vote
DAM
2010
15 years 1 months ago
2010
An assignment of positive integer weights to the edges of a simple graph G is called irregular if the weighted degrees of the vertices are all different. The irregularity strength,...