3946 search results - page 48 / 790 » The computational complexity of choice sets |
WG
1992
Springer
15 years 3 months ago
1992
Springer
The recognition complexityof ordered set properties is considered, i.e.how many questions have to be asked to decide if an unknown ordered set has a prescribed property. We prove ...
101
click to vote
GD
2009
Springer
15 years 3 months ago
2009
Springer
We show that recognizing intersection graphs of convex sets has the same complexity as deciding truth in the existential theory of the reals. Comparing this to similar results on t...
86
Voted
STOC
2007
ACM
16 years 3 days ago
2007
ACM
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
SIGGRAPH
2003
ACM
15 years 5 months ago
2003
ACM
Blend shape animation is the method of choice for keyframe facial animation: a set of blend shapes (key facial expressions) are used to define a linear space of facial expression...
ACL
2012
13 years 2 months ago
2012
Argo is a web-based NLP and text mining workbench with a convenient graphical user interface for designing and executing processing workflows of various complexity. The workbench...