2487 search results - page 142 / 498 » Partitions of Graphs into Trees |
107
Voted
SC
2003
ACM
15 years 8 months ago
2003
ACM
We present a novel approach for decomposing contact/impact computations in which the mesh elements come in contact with each other during the course of the simulation. Effective d...
168
click to vote
SC
1993
ACM
15 years 7 months ago
1993
ACM
In this paper, we describe two new ideas by which HPF compiler can deal with irregular computations e ectively. The rst mechanism invokes a user speci ed mapping procedure via a s...
148
Voted
CASES
2001
ACM
15 years 7 months ago
2001
ACM
We consider handheld computing devices which are connected to a server (or a powerful desktop machine) via a wireless LAN. On such devices, it is often possible to save the energy...
142
Voted
IWDC
2005
Springer
15 years 9 months ago
2005
Springer
This paper deals with compact label-based representations for trees. Consider an n-node undirected connected graph G with a predefined numbering on the ports of each node. The al...
162
click to vote
FPGA
2001
ACM
15 years 8 months ago
2001
ACM
Discrete wavelet transformations (DWT) followed by embedded zerotree encoding is a very efficient technique for image compression [2, 5, 4]. However, the algorithms proposed in l...