2314 search results - page 88 / 463 » Minimal Partitions of a Graph |
137
Voted
ISSS
1996
IEEE
15 years 7 months ago
1996
IEEE
The paper presents two heuristics for hardware/software partitioning of system level specifications. The main objective is to achieve performance optimization with a limited hardw...
138
click to vote
CPC
2007
15 years 3 months ago
2007
Abstract. Szemer´edi’s regularity lemma for graphs has proved to be a powerful tool with many subsequent applications. The objective of this paper is to extend the techniques de...
125
Voted
FPGA
1995
ACM
15 years 7 months ago
1995
ACM
This paper considers the problem of partitioning a circuit into a collection of subcircuits, such that each subcircuit is feasible for some device from an FPGA library, and the to...
148
Voted
ICDE
2010
IEEE
15 years 10 months ago
2010
IEEE
— In this paper we propose PARINET, a new access method to efficiently retrieve the trajectories of objects moving in networks. The structure of PARINET is based on a combination...
150
Voted
SC
2003
ACM
15 years 8 months ago
2003
ACM
Load balance is critical to achieving scalability for large network emulation studies, which are of compelling interest for emerging Grid, Peer to Peer, and other distributed appl...