Sciweavers

217 search results - page 32 / 44
» Synthesizing Probabilistic Composers
Sort
View
TOG
2012
193views Communications» more  TOG 2012»
11 years 11 months ago
Continuous character control with low-dimensional embeddings
Interactive, task-guided character controllers must be agile and responsive to user input, while retaining the flexibility to be readily authored and modified by the designer. C...
Sergey Levine, Jack M. Wang, Alexis Haraux, Zoran ...
IANDC
2007
152views more  IANDC 2007»
13 years 8 months ago
The reactive simulatability (RSIM) framework for asynchronous systems
We define reactive simulatability for general asynchronous systems. Roughly, simulatability means that a real system implements an ideal system (specification) in a way that pre...
Michael Backes, Birgit Pfitzmann, Michael Waidner
ICDT
2009
ACM
166views Database» more  ICDT 2009»
14 years 9 months ago
A compositional framework for complex queries over uncertain data
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
Christoph Koch, Michaela Götz
DAC
2008
ACM
14 years 9 months ago
The synthesis of robust polynomial arithmetic with stochastic logic
As integrated circuit technology plumbs ever greater depths in the scaling of feature sizes, maintaining the paradigm of deterministic Boolean computation is increasingly challeng...
Weikang Qian, Marc D. Riedel
SCALESPACE
2007
Springer
14 years 2 months ago
Non-negative Sparse Modeling of Textures
This paper presents a statistical model for textures that uses a non-negative decomposition on a set of local atoms learned from an exemplar. This model is described by the varianc...
Gabriel Peyré