432 search results - page 44 / 87 » Internally deterministic parallel algorithms can be fast |
157
click to vote
CW
2004
IEEE
15 years 5 months ago
2004
IEEE
This paper presents an approach to realize a tool for interactive and intuitive deformation of 3D shapes. The approach combines a fast algorithm for 3D free form deformation that ...
117
click to vote
FCCM
2002
IEEE
15 years 6 months ago
2002
IEEE
To fully realize the benefits of partial and rapid reconfiguration of field-programmable devices, we often need to dynamically schedule computing tasks and generate instance-sp...
146
click to vote
JCPHY
2011
14 years 4 months ago
2011
The calculation of radial distribution functions (RDFs) from molecular dynamics trajectory data is a common and computationally expensive analysis task. The rate limiting step in ...
135
click to vote
SPAA
2009
ACM
15 years 8 months ago
2009
ACM
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
116
click to vote
SPAA
2003
ACM
15 years 7 months ago
2003
ACM
Link reversal algorithms provide a simple mechanism for routing in mobile ad hoc networks. These algorithms maintain routes to any particular destination in the network, even when...