1381 search results - page 90 / 277 » Computational Complexity of Constraint Satisfaction |
151
click to vote
SIGGRAPH
1990
ACM
15 years 8 months ago
1990
ACM
We describe a fast method for creating physically based animation of non-rigid objects. Rapid simulation of nonrigid behavior is based on global deformations. Constraints are used...
147
click to vote
WG
2001
Springer
15 years 8 months ago
2001
Springer
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...
229
click to vote
MST
2010
15 years 2 months ago
2010
We study a family of problems, called Maximum Solution (Max Sol), where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variab...
134
Voted
JUCS
2010
15 years 2 months ago
2010
Abstract: In Service-Oriented Computing (SOC) environments, service clients interact with service providers for consuming services. From the viewpoint of service clients, the trust...
141
click to vote
SIGGRAPH
1996
ACM
15 years 8 months ago
1996
ACM
This paper describesthe application of spacetime constraints to creating transitions between segments of human body motion. The motion transition generation uses a combination of ...