3267 search results - page 195 / 654 » Generalized quasirandom graphs |
212
click to vote
AUSAI
2009
Springer
16 years 1 months ago
2009
Springer
In the era of information explosion, structured data emerge on a large scale. As a description of structured data, network has drawn attention of researchers in many subjects. Netw...
152
click to vote
FCT
2009
Springer
16 years 1 months ago
2009
Springer
In social network theory, a simple graph G is called k-role assignable if there is a surjective mapping that assigns a number from {1, . . . , k} called a role to each vertex of G ...
161
click to vote
ICIP
2007
IEEE
16 years 27 days 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...
171
click to vote
PAKDD
2004
ACM
15 years 12 months ago
2004
ACM
This paper proposes a two-step graph partitioning method to discover constrained clusters with an objective function that follows the well-known minmax clustering principle. Compar...
166
click to vote
ICCAD
1999
IEEE
15 years 11 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...