7106 search results - page 366 / 1422 » Restricted Complexity, General Complexity |
178
click to vote
SIAMDM
2010
15 years 3 months ago
2010
For a fixed graph H, let Ret(H) denote the problem of deciding whether a given input graph is retractable to H. We classify the complexity of Ret(H) when H is a graph (with loops ...
163
click to vote
SIGGRAPH
1998
ACM
15 years 9 months ago
1998
ACM
The creation of believable and endearing characters in computer graphics presents a number of technical challenges, including the modeling, animation and rendering of complex shap...
155
click to vote
SIGGRAPH
1995
ACM
15 years 8 months ago
1995
ACM
In computer graphics and geometric modeling, shapes are often represented by triangular meshes. With the advent of laser scanning systems, meshes of extreme complexity are rapidly...
127
click to vote
AAAI
2008
15 years 7 months ago
2008
ar for abstract concepts, and a number of formally expressed, structural restrictions. Copyright c 2008, Association for the Advancement of Artificial Intelligence (www.aaai.org). ...
205
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables ...