Lars Graf, Thomas Bohnstingl, et al.
NeurIPS 2025
The problem of finding the circular attributes in an attribute grammar is considered. Two algorithms are proposed: the first is polynomial but yields conservative results while the second is exact but is potentially exponential. It is also shown that finding the circular attributes is harder than testing circularity. © 1999 ACM.
Lars Graf, Thomas Bohnstingl, et al.
NeurIPS 2025
Paul G. Comba
Journal of the ACM
David W. Jacobs, Daphna Weinshall, et al.
IEEE Transactions on Pattern Analysis and Machine Intelligence
Susan L. Spraragen
International Conference on Design and Emotion 2010