Sciweavers

27 search results - page 5 / 6
» Invariant games
Sort
View
FOCS
2009
IEEE
14 years 2 months ago
Agnostic Learning of Monomials by Halfspaces Is Hard
— We prove the following strong hardness result for learning: Given a distribution on labeled examples from the hypercube such that there exists a monomial (or conjunction) consi...
Vitaly Feldman, Venkatesan Guruswami, Prasad Ragha...
CSL
2007
Springer
14 years 1 months ago
Typed Normal Form Bisimulation
Normal form bisimulation is a powerful theory of program equivalence, originally developed to characterize L´evy-Longo tree equivalence and Boehm tree equivalence. It has been ada...
Søren B. Lassen, Paul Blain Levy
SIGGRAPH
2010
ACM
13 years 11 months ago
A deformation transformer for real-time cloth animation
Achieving interactive performance in cloth animation has significant implications in computer games and other interactive graphics applications. Although much progress has been m...
Wei-Wen Feng, Yizhou Yu, Byung-Uck Kim
FUIN
2006
97views more  FUIN 2006»
13 years 7 months ago
Interactive Systems with Registers and Voices
We present a model and a core programming language appropriate for modeling and programming interactive computing systems. The model consists of rv-systems (interactive systems wit...
Gheorghe Stefanescu
AUTOMATICA
1999
119views more  AUTOMATICA 1999»
13 years 7 months ago
Robust L2-gain control for nonlinear systems with projection dynamics and input constraints: an example from traffic control
We formulate the L2-gain control problem for a general nonlinear, state-space system with projection dynamics in the state evolution and hard constraints on the set of admissible ...
Joseph A. Ball, Martin V. Day, Tungsheng Yu, Pushk...