6181 search results - page 428 / 1237 » Transactional Cluster Computing |
158
click to vote
GD
1999
Springer
15 years 11 months ago
1999
Springer
In this paper we present a novel approach for cluster-based drawing of large planar graphs that maintains planarity. Our technique works for arbitrary planar graphs and produces a ...
199
click to vote
HPDC
1998
IEEE
15 years 11 months ago
1998
IEEE
This paper introduces Strings, a high performance distributed shared memory system designed for clusters of symmetrical multiprocessors (SMPs). The distinguishing feature of this ...
214
click to vote
RT
1995
Springer
15 years 10 months ago
1995
Springer
: This paper introduces an efficient hierarchical algorithm capable of simulating light transfer for complex scenes containing non-diffuse surfaces. The algorithmstemsfroma newfor...
176
click to vote
LWA
2007
15 years 8 months ago
2007
Abstract: Currently, social bookmarking systems provide intuitive support for browsing locally their content. A global view is usually presented by the tag cloud of the system, but...
184
click to vote
NIPS
2001
15 years 8 months ago
2001
The popular K-means clustering partitions a data set by minimizing a sum-of-squares cost function. A coordinate descend method is then used to nd local minima. In this paper we sh...