2756 search results - page 298 / 552 » Parallel Mesh Generation |
143
click to vote
SPAA
2004
ACM
15 years 8 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
168
click to vote
SPAA
1996
ACM
15 years 7 months ago
1996
ACM
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
129
click to vote
ICDCS
2010
IEEE
15 years 7 months ago
2010
IEEE
—This research focuses on distributed and localized algorithms for precise boundary detection in 3D wireless networks. Our objectives are in two folds. First, we aim to identify ...
137
click to vote
DCOSS
2006
Springer
15 years 6 months ago
2006
Springer
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
138
click to vote
ICDCS
2010
IEEE
15 years 6 months ago
2010
IEEE
In recent years, we have seen a surge of interest in enabling communications over meshed wireless networks. Particularly, supporting peer-to-peer communications over a multi-hop w...