2314 search results - page 192 / 463 » Minimal Partitions of a Graph |
109
click to vote
IPPS
2000
IEEE
15 years 8 months ago
2000
IEEE
In this paper, we present a method to estimate the number of reconfiguration steps that a time-constrained algorithm can accommodate. This analysis demonstrates how one would attac...
150
click to vote
ASPDAC
2001
ACM
15 years 7 months ago
2001
ACM
This paper deals with address assignment in code generation for digital signal processors (DSPs) with SIMD (single instruction multiple data) memory accesses. In these processors ...
144
click to vote
SIROCCO
2008
15 years 5 months ago
2008
The augmented graph model, as introduced by Kleinberg (STOC 2000), is an appealing model for analyzing navigability in social networks. Informally, this model is defined by a pair...
122
click to vote
ICMCS
2006
IEEE
15 years 10 months ago
2006
IEEE
We present an unequal iterative decoding (UID) approach for minimization of the receiver power consumption subject to a given quality of service, by exploiting data partitioning a...
132
Voted
HIPC
2005
Springer
15 years 9 months ago
2005
Springer
We examine the problem of scheduling concurrent independent flows on multiple-disk I/O storage systems. Two models are considered: in the shared buffer model the memory buffer is ...