4171 search results - page 653 / 835 » Choice numbers of graphs |
162
click to vote
ICPR
2004
IEEE
16 years 7 months ago
2004
IEEE
Numerous clustering algorithms, their taxonomies and evaluation studies are available in the literature. Despite the diversity of different clustering algorithms, solutions delive...
177
click to vote
PPOPP
2009
ACM
16 years 7 months ago
2009
ACM
Irregular programs are programs organized around pointer-based data structures such as trees and graphs. Recent investigations by the Galois project have shown that many irregular...
204
click to vote
KDD
2005
ACM
16 years 7 months ago
2005
ACM
Frequent-pattern mining has been studied extensively on scalable methods for mining various kinds of patterns including itemsets, sequences, and graphs. However, the bottleneck of...
207
click to vote
VLSID
2004
IEEE
16 years 6 months ago
2004
IEEE
In this paper, we describe NoCGEN, a Network On Chip (NoC) generator, which is used to create a simulatable and synthesizable NoC description. NoCGEN uses a set of modularised rou...
160
click to vote
VLSID
2002
IEEE
16 years 6 months ago
2002
IEEE
Interconnect delay has become a critical factor in determining the performance of integrated circuits. Routing and buffering are powerful means of improving the circuit speed and ...