1424 search results - page 159 / 285 » Improving on Version Stamps |
169
click to vote
WMPI
2004
ACM
15 years 12 months ago
2004
ACM
The Opie Project aims to develop a compiler to transform C codes written for row-major matrix representation into equivalent codes for Morton-order matrix representation, and to a...
164
click to vote
GD
2003
Springer
15 years 11 months ago
2003
Springer
In this paper we consider the problem of drawing a planar graph using circular arcs as edges, given a one-to-one mapping between the vertices of the graph and a set of points in t...
215
click to vote
SWAT
2010
Springer
15 years 11 months ago
2010
Springer
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
167
click to vote
ICS
2009
Tsinghua U.
15 years 11 months ago
2009
Tsinghua U.
Modern GPUs offer much computing power at a very modest cost. Even though CUDA and other related recent developments are accelerating the use of GPUs for general purpose applicati...
144
click to vote
SIGUCCS
2000
ACM
15 years 11 months ago
2000
ACM
The Web Documentation Project at the University of Delaware (UD) organizes the computing help information available to the University community. The project’s goal is to provide...