1951 search results - page 82 / 391 » An algorithm for improving graph partitions |
156
click to vote
ICCS
2009
Springer
15 years 10 months ago
2009
Springer
Irregular and sparse scientific computing programs frequently experience performance losses due to inefficient use of the memory system in most machines. Previous work has shown t...
126
click to vote
ISCAS
2003
IEEE
15 years 9 months ago
2003
IEEE
Improving testability during the early stages of High-Level Synthesis (HLS) has several benefits, including reduced test hardware overhead, reduced test costs, reduced design iter...
146
Voted
GD
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. Constrained graph layout is a recent generalisation of forcedirected graph layout which allows constraints on node placement. We give a constrained graph layout algorithm...
224
click to vote
ICDT
2009
ACM
16 years 4 months ago
2009
ACM
Partitioning is an important step in several database algorithms, including sorting, aggregation, and joins. Partitioning is also fundamental for dividing work into equal-sized (o...
156
click to vote
ALMOB
2006
15 years 4 months ago
2006
Given a set S of n locally aligned sequences, it is a needed prerequisite to partition it into groups of very similar sequences to facilitate subsequent computations, such as the ...