George Saon
SLT 2014
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.
George Saon
SLT 2014
Amarachi Blessing Mbakwe, Joy Wu, et al.
NeurIPS 2023
Leonid Karlinsky, Joseph Shtok, et al.
CVPR 2019
Zhikun Yuen, Paula Branco, et al.
DSAA 2023