3020 search results - page 251 / 604 » Optimal partition trees |
203
click to vote
GLOBECOM
2006
IEEE
16 years 22 days ago
2006
IEEE
Abstract— Wireless sensor networks (WSNs) employed in monitoring applications require data collected by the sensors to be deposited at specific nodes, referred to as drains. To ...
189
click to vote
ESA
2005
Springer
16 years 3 days ago
2005
Springer
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
141
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
We study the problem of mapping the N nodes of a complete t-ary tree on M memory modules so that they can be accessed in parallel by templates, i.e. distinct sets of nodes. Typica...
182
click to vote
VISUALIZATION
1998
IEEE
15 years 11 months ago
1998
IEEE
Many high-performance isosurface extraction algorithms have been proposed in the past several years as a result of intensive research efforts. When applying these algorithms to la...
184
click to vote
DAC
1989
ACM
15 years 10 months ago
1989
ACM
: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...