4926 search results - page 81 / 986 » Two Graph Algorithms On an Associative Computing Model |
132
click to vote
CG
2005
Springer
15 years 2 months ago
2005
Springer
A new algorithm for Boolean operations on general planar polygons is presented. It is available for general planar polygons (manifold or non-manifold, with or without holes). Edge...
106
click to vote
ANOR
2008
15 years 2 months ago
2008
We describe a class of problems motivated by numerous real-world applications where there is a collection of objects that have both a cost and a value, but where some of those obj...
ISCA
2000
IEEE
15 years 6 months ago
2000
IEEE
As DRAM access latencies approach a thousand instructionexecution times and on-chip caches grow to multiple megabytes, it is not clear that conventional cache structures continue ...
115
click to vote
MFCS
2004
Springer
15 years 7 months ago
2004
Springer
We study the on-line versions of two fundamental graph problems, maximum independent set and minimum coloring, for the case of disk graphs which are graphs resulting from intersect...
210
Voted
SIGMOD
2008
ACM
16 years 2 months ago
2008
ACM
Graphs are widely used to model real world objects and their relationships, and large graph datasets are common in many application domains. To understand the underlying character...