4926 search results - page 107 / 986 » Two Graph Algorithms On an Associative Computing Model |
107
Voted
DATE
2006
IEEE
15 years 8 months ago
2006
IEEE
Soft errors have emerged as an important reliability challenge for nanoscale VLSI designs. In this paper, we present a fast and efficient soft error rate (SER) computation algorit...
113
click to vote
AICCSA
2005
IEEE
15 years 8 months ago
2005
IEEE
In this paper we present three algorithms that build graph layouts for undirected, weighted graphs. Our goal is to generate layouts that are consistent with the weights in the gra...
115
click to vote
STACS
2001
Springer
15 years 7 months ago
2001
Springer
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
140
click to vote
DAM
2011
14 years 9 months ago
2011
In this paper, we study the Minimum Sum Set Coloring (MSSC) problem which consists in assigning a set of x(v) positive integers to each vertex v of a graph so that the intersectio...
164
Voted
CGF
2011
14 years 6 months ago
2011
We investigate the use of two-level nested grids as acceleration structure for ray tracing of dynamic scenes. We propose a massively parallel, sort-based construction algorithm an...