Sciweavers

2924 search results - page 466 / 585
» Lower Bounds in Distributed Computing
Sort
View
ICPP
2006
IEEE
16 years 13 days ago
Worst-Case Delay Control in Multi-Group Overlay Networks
This paper proposes a novel and simple adaptive control algorithm for the effective delay control and resource utilization of EMcast when the traffic load becomes heavy in the mu...
Wanqing Tu
IPPS
2006
IEEE
16 years 13 days ago
A framework to develop symbolic performance models of parallel applications
Performance and workload modeling has numerous uses at every stage of the high-end computing lifecycle: design, integration, procurement, installation and tuning. Despite the trem...
Sadaf R. Alam, Jeffrey S. Vetter
CONEXT
2006
ACM
16 years 11 days ago
Shortcuts in a virtual world
We consider the case of a virtual world of peers that are organized in an overlay built by Delaunay Triangulation. Application layer routing is used to determine the path taken in...
Moritz Steiner, Ernst W. Biersack
SPAA
2005
ACM
15 years 12 months ago
Finding effective support-tree preconditioners
In 1995, Gremban, Miller, and Zagha introduced supporttree preconditioners and a parallel algorithm called supporttree conjugate gradient (STCG) for solving linear systems of the ...
Bruce M. Maggs, Gary L. Miller, Ojas Parekh, R. Ra...
CW
2002
IEEE
15 years 11 months ago
Free-Form Deformation with Automatically Generated Multiresolution Lattices
Developing intuitive and efficient methods for shape editing is one of the most important areas in computer graphics, and free-form deformation (FFD), which is one of such methods...
Yutaka Ono, Bing-Yu Chen, Tomoyuki Nishita, Jieqin...