Sciweavers

549 search results - page 2 / 110
» Computing All the Best Swap Edges Distributively
Sort
View
DAGSTUHL
2010
13 years 6 months ago
Generalized Swap Operation for Tetrahedrizations
Mesh optimization of 2D and 3D triangulations is used in multiple applications extensively. For example, mesh optimization is crucial in the context of adaptively discretizing geo...
Burkhard Lehner, Bernd Hamann, Georg Umlauf
ALGORITHMICA
2000
85views more  ALGORITHMICA 2000»
13 years 5 months ago
An Algorithm for Enumerating All Spanning Trees of a Directed Graph
We present an O(NV +V 3) time algorithm for enumerating all spanning trees of a directed graph. This improves the previous best known bound of O(NE + V + E) [1] when V 2 = o(N), wh...
Sanjiv Kapoor, H. Ramesh
IAT
2009
IEEE
13 years 12 months ago
Cluster-Swap: A Distributed K-median Algorithm for Sensor Networks
In building practical sensor networks, it is often beneficial to use only a subset of sensors to take measurements because of computational, communication, and power limitations....
Yoonheui Kim, Victor R. Lesser, Deepak Ganesan, Ra...
ICPP
2000
IEEE
13 years 9 months ago
Multilayer VLSI Layout for Interconnection Networks
Current VLSI technology allows more than two wiring layers and the number is expected to rise in future. In this paper, we show that, by designing VLSI layouts directly for an L-l...
Chi-Hsiang Yeh, Emmanouel A. Varvarigos, Behrooz P...
HPDC
2003
IEEE
13 years 10 months ago
Policies for Swapping MPI Processes
Despite the enormous amount of research and development work in the area of parallel computing, it is a common observation that simultaneous performance and ease-of-use are elusiv...
Otto Sievert, Henri Casanova