Sciweavers

2950 search results - page 60 / 590
» Computing with Infinitely Many Processes
Sort
View
CEC
2010
IEEE
13 years 10 months ago
Principles of protein processing for a self-organising associative memory
The evolution of Artificial Intelligence has passed through many phases over the years, going from rigorous mathematical grounding to more intuitive bio-inspired approaches. Despit...
Omer Qadir, Jerry Liu, Jon Timmis, Gianluca Tempes...
CGF
2006
177views more  CGF 2006»
13 years 9 months ago
Direct (Re)Meshing for Efficient Surface Processing
We propose a novel surface remeshing algorithm. While many remeshing algorithms are based on global parametrization or local mesh optimization, our algorithm is closely related to...
John M. Schreiner, Carlos Eduardo Scheidegger, Sha...
CSUR
2006
121views more  CSUR 2006»
13 years 9 months ago
A taxonomy of Data Grids for distributed data sharing, management, and processing
Data Grids have been adopted as the next-generation platform by many scientific communities that need to share, access, transport, process and manage large data collections distri...
Srikumar Venugopal, Rajkumar Buyya, Kotagiri Ramam...
ESTIMEDIA
2009
Springer
13 years 7 months ago
Efficient execution of Kahn process networks on multi-processor systems using protothreads and windowed FIFOs
As single-processor systems are ceasing to scale effectively, multi-processor systems are becoming more and more popular. While there are many challenges of designing multi-process...
Wolfgang Haid, Lars Schor, Kai Huang, Iuliana Baci...
CGF
2008
153views more  CGF 2008»
13 years 9 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