Sciweavers

7200 search results - page 300 / 1440
» On the Computational Power of Winner-Take-All
Sort
View
CGF
2008
153views more  CGF 2008»
15 years 6 months ago
Computing Local Signed Distance Fields for Large Polygonal Models
The signed distance field for a polygonal model is a useful representation that facilitates efficient computation in many visualization and geometric processing tasks. Often it is...
Byungjoon Chang, Deukhyun Cha, Insung Ihm
COMPGEOM
2009
ACM
16 years 1 months ago
Parallel geometric algorithms for multi-core computers
Computers with multiple processor cores using shared memory are now ubiquitous. In this paper, we present several parallel geometric algorithms that specifically target this envi...
Vicente H. F. Batista, David L. Millman, Sylvain P...
BIRTHDAY
2005
Springer
16 years 7 days ago
Towards Comprehensive Computational Models for Plan-Based Control of Autonomous Robots
In this paper we present an overview of recent developments in the plan-based control of autonomous robots. We identify computational principles that enable autonomous robots to a...
Michael Beetz
HPDC
2002
IEEE
15 years 11 months ago
Distributed Computing with Load-Managed Active Storage
One approach to high-performance processing of massive data sets is to incorporate computation into storage systems. Previous work has shown that this active storage model is effe...
Rajiv Wickremesinghe, Jeffrey S. Chase, Jeffrey Sc...
AE
2001
Springer
15 years 11 months ago
Why Biologists and Computer Scientists Should Work Together
This is a time of increasing interdisciplinary research. Computer science is learning more from biology every day, enabling a plethora of new software techniques to flourish. And b...
Peter J. Bentley