819 search results - page 84 / 164 » Parallelization with Tree Skeletons |
106
click to vote
CGF
2000
14 years 11 months ago
2000
In this paper, we propose a novel external-memory algorithm to support view-dependent simplification for datasets much larger than main memory. In the preprocessing phase, we use ...
101
click to vote
HIPEAC
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Designers of large parallel computers and clusters are becoming increasingly concerned with the cost and power consumption of the interconnection network. A simple way to...
111
click to vote
DCOSS
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
SPAA
2010
ACM
15 years 4 months ago
2010
ACM
The aim of rendezvous in a graph is meeting of two mobile agents at some node of an unknown anonymous connected graph. The two identical agents start from arbitrary nodes in the g...
SPAA
1996
ACM
15 years 4 months ago
1996
ACM
We analyze the relationship between the expected packet delay in rooted tree networks and the distribution of time needed for a packet to cross an edge using convexity-based stoch...