Sciweavers

455 search results - page 42 / 91
» Dynamic well-spaced point sets
Sort
View
ICFP
2006
ACM
15 years 9 months ago
Delimited dynamic binding
Dynamic binding and delimited control are useful together in many settings, including Web applications, database cursors, and mobile code. We examine this pair of language feature...
Oleg Kiselyov, Chung-chieh Shan, Amr Sabry
TVCG
2011
188views more  TVCG 2011»
14 years 4 months ago
Data-Parallel Octrees for Surface Reconstruction
—We present the first parallel surface reconstruction algorithm that runs entirely on the GPU. Like existing implicit surface reconstruction methods, our algorithm first builds...
Kun Zhou, Minmin Gong, Xin Huang, Baining Guo
ECRTS
2006
IEEE
15 years 3 months ago
Optimal On-Line Scheduling of Multiple Control Tasks: A Case Study
We study the problem of dynamically scheduling a set of state-feedback control tasks controlling a set of linear plants. We consider an on-line non-preemptive scheduling policy th...
Anton Cervin, Peter Alriksson
ICMI
2007
Springer
199views Biometrics» more  ICMI 2007»
15 years 4 months ago
Interest estimation based on dynamic bayesian networks for visual attentive presentation agents
In this paper, we describe an interface consisting of a virtual showroom where a team of two highly realistic 3D agents presents product items in an entertaining and attractive wa...
Boris Brandherm, Helmut Prendinger, Mitsuru Ishizu...
IPPS
2009
IEEE
15 years 4 months ago
Phaser accumulators: A new reduction construct for dynamic parallelism
A reduction is a computation in which a common operation, such as a sum, is to be performed across multiple pieces of data, each supplied by a separate task. We introduce phaser a...
Jun Shirako, David M. Peixotto, Vivek Sarkar, Will...