2314 search results - page 15 / 463 » Minimal Partitions of a Graph |
BNCOD
1997
13 years 9 months ago
1997
Abstract. In this paper we present two improvements to the partitioning process: 1) A new dynamic bu er management strategy is employed to increase the average block size of I/O-tr...
ICDM
2008
IEEE
14 years 2 months ago
2008
IEEE
In graph mining, a frequency measure is anti-monotonic if the frequency of a pattern never exceeds the frequency of a subpattern. The efficiency and correctness of most graph pat...
ADC
2008
Springer
14 years 2 months ago
2008
Springer
Existing graph mining algorithms typically assume that the dataset can fit into main memory. As many large graph datasets cannot satisfy this condition, truly scalable graph minin...
DATE
2003
IEEE
14 years 1 months ago
2003
IEEE
We present a high-level synthesis algorithm solving the combined scheduling, allocation and binding problem minimizing area under both latency and maximum power per clock-cycle co...
HPDC
2007
IEEE
14 years 2 months ago
2007
IEEE
This paper describes a novel approach to generate an optimized schedule to run threads on distributed shared memory (DSM) systems. The approach relies upon a binary instrumentatio...