4679 search results - page 730 / 936 » The Timely Computing Base Model and Architecture |
176
click to vote
SIGGRAPH
2010
ACM
15 years 11 months ago
2010
ACM
High-order and regularly sampled surface representations are more efficient and compact than general meshes and considerably simplify many geometric modeling and processing algor...
181
click to vote
JCM
2007
15 years 6 months ago
2007
—Divisible loads are those workloads that can be partitioned by a scheduler into any arbitrary chunks. The problem of scheduling divisible loads has been defined for a long time,...
207
click to vote
CVPR
2004
IEEE
16 years 8 months ago
2004
IEEE
The visual effects of rain are complex. Rain consists of spatially distributed drops falling at high velocities. Each drop refracts and reflects the environment, producing sharp i...
157
click to vote
ICDM
2005
IEEE
16 years 3 days ago
2005
IEEE
Data mining algorithms are facing the challenge to deal with an increasing number of complex objects. For graph data, a whole toolbox of data mining algorithms becomes available b...
188
click to vote
CEC
2010
IEEE
15 years 7 months ago
2010
IEEE
Computational science is placing new demands on optimization algorithms as the size of data sets and the computational complexity of scientific models continue to increase. As thes...