6437 search results - page 392 / 1288 » Parallel Algorithms for Arrangements |
145
click to vote
GD
2003
Springer
15 years 9 months ago
2003
Springer
A drawing of a family of cuts of a graph is an augmented drawing of the graph such that every cut in the family is represented by a simple closed curve and vice versa. We show tha...
155
click to vote
PATMOS
2000
Springer
15 years 8 months ago
2000
Springer
Exploitation of data re-use in combination with the use of custom memory hierarchy that exploits the temporal locality of data accesses may introduce significant power savings, esp...
146
click to vote
TPDS
2002
15 years 4 months ago
2002
In this paper, an efficient algorithm to implement loop partitioning is introduced and evaluated. We start from results of Agarwal et al. [1] whose aim is to minimize the number of...
130
click to vote
TROB
2002
15 years 4 months ago
2002
Abstract--This paper investigates the synthesis of a spatial stiffness matrix using simple line springs. A new algorithm is developed, which enables the selection of constituent sp...
130
Voted
PVLDB
2010
15 years 2 months ago
2010
This paper describes a high performance sampling architecture for inference of latent topic models on a cluster of workstations. Our system is faster than previous work by over an...