Sciweavers

6365 search results - page 1171 / 1273
» Fast Local Computation Algorithms
Sort
View
EUROGRAPHICS
2010
Eurographics
16 years 3 months ago
Exact and Robust (Self-)Intersections for Polygonal Meshes
We present a new technique to implement operators that modify the topology of polygonal meshes at intersections and self-intersections. Depending on the modification strategy, th...
Marcel Campen and Leif Kobbelt
IPPS
2000
IEEE
15 years 10 months ago
Run-Time Support for Adaptive Load Balancing
Abstract. Many parallel scienti c applications have dynamic and irregular computational structure. However, most such applications exhibit persistence of computational load and com...
Milind A. Bhandarkar, Robert Brunner, Laxmikant V....
VRML
1999
ACM
15 years 10 months ago
VIRTUS: A Collaborative Multi-User Platform
VRML is a file format for the description of dynamic scene graphs containing 3D objects with their visual appearance, multimedia content, an event model, and scripting capabilitie...
Kurt Saar
ANCS
2007
ACM
15 years 10 months ago
On LID assignment in infiniBand networks
To realize a path in an InfiniBand network, an address, known as Local IDentifier (LID) in the InfiniBand specification, must be assigned to the destination and used in the forwar...
Wickus Nienaber, Xin Yuan, Zhenhai Duan
SPAA
2012
ACM
13 years 8 months ago
Allowing each node to communicate only once in a distributed system: shared whiteboard models
In this paper we study distributed algorithms on massive graphs where links represent a particular relationship between nodes (for instance, nodes may represent phone numbers and ...
Florent Becker, Adrian Kosowski, Nicolas Nisse, Iv...
« Prev « First page 1171 / 1273 Last » Next »