Sciweavers

13621 search results - page 424 / 2725
» Computability and Complexity in Self-assembly
Sort
View
CONCURRENCY
2002
230views more  CONCURRENCY 2002»
15 years 6 months ago
Economic models for resource management and scheduling in Grid computing
: The accelerated development in Peer-to-Peer (P2P) and Grid computing has positioned them as promising next generation computing platforms. They enable the creation of Virtual Ent...
Rajkumar Buyya, David Abramson, Jonathan Giddy, He...
SIGGRAPH
1993
ACM
15 years 11 months ago
Global visibility algorithms for illumination computations
The most expensive geometric operation in image synthesis is visibility determination. Classically this is solved with hidden surface removal algorithms that render only the parts...
Seth J. Teller, Pat Hanrahan
DEXA
2008
Springer
132views Database» more  DEXA 2008»
15 years 8 months ago
Efficient Updates for Continuous Skyline Computations
We address the problem of maintaining continuous skyline queries efficiently over dynamic objects with d dimensions. Skyline queries are an important new search capability for mult...
Yu-Ling Hsueh, Roger Zimmermann, Wei-Shinn Ku
NIPS
2000
15 years 8 months ago
The Use of MDL to Select among Computational Models of Cognition
How should we decide among competing explanations of a cognitive process given limited observations? The problem of model selection is at the heart of progress in cognitive scienc...
In Jae Myung, Mark A. Pitt, Shaobo Zhang, Vijay Ba...
PPOPP
2009
ACM
16 years 7 months ago
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
Seunghwa Kang, David A. Bader