Sciweavers

2950 search results - page 277 / 590
» Computing with Infinitely Many Processes
Sort
View
IPPS
2006
IEEE
16 years 21 days ago
Load balancing in the presence of random node failure and recovery
In many distributed computing systems that are prone to either induced or spontaneous node failures, the number of available computing resources is dynamically changing in a rando...
Sagar Dhakal, Majeed M. Hayat, Jorge E. Pezoa, Cha...
183
Voted
EGH
2004
Springer
16 years 2 days ago
A quadrilateral rendering primitive
The only surface primitives that are supported by common graphics hardware are triangles and more complex shapes have to be triangulated before being sent to the rasterizer. Even ...
Kai Hormann, Marco Tarini
GRAPHICSINTERFACE
2007
15 years 8 months ago
Constrained planar remeshing for architecture
Material limitations and fabrication costs generally run at odds with the creativity of architectural design, producing a wealth of challenging computational geometry problems. We...
Barbara Cutler, Emily Whiting
ERSA
2003
147views Hardware» more  ERSA 2003»
15 years 8 months ago
Towards Run-Time Re-Configurable Techniques for Real-Time Embedded Applications
Many embedded applications can benefit from the flexible custom computing opportunities that FPGA technology offers. The Run-Time Reconfiguration (RTR) of the FPGA as an applicati...
Timothy F. Oliver, Douglas L. Maskell
CGF
2002
187views more  CGF 2002»
15 years 6 months ago
Stylizing Silhouettes at Interactive Rates: From Silhouette Edges to Silhouette Strokes
A way to create effective stylized line drawings is to draw strokes that start and stop at visible portions along the silhouette of an object to be portrayed. In computer graphics...
Tobias Isenberg, Nick Halper, Thomas Strothotte