103 search results - page 11 / 21 » Graph partitioning using single commodity flows |
84
Voted
IPPS
2000
IEEE
15 years 4 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...
117
Voted
AHS
2007
IEEE
15 years 4 months ago
2007
IEEE
In this paper, we propose a design methodology for implementing a multimode (or multi-configuration) and multi-throughput system into a single hardware architecture. The inputs of...
128
click to vote
IVS
2006
15 years 13 days ago
2006
Business operations involve many factors and relationships and are modeled as complex business process workflows. The execution of these business processes generates vast volumes ...
150
Voted
Publication
For quantitative analysis of histopathological images,
such as the lymphoma grading systems, quantification of
features is usually carried out on single cells before categorizing...
124
click to vote
NETWORKS
2002
15 years 3 days ago
2002
Consider a requirement graph whose vertices represent customers and an edge represents the need to route a unit of flow between its end vertices along a single path. All of these ...