You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Very interesting work, thank you.
One limitation mentionned in the article is that predicate can only be unary or binary. This is quite limiting. How can the factor graph idea be generalized to larger arity ?
The text was updated successfully, but these errors were encountered:
On Wed, Feb 15, 2017 at 9:06 AM, pcarbonn ***@***.***> wrote:
Very interesting work, thank you.
One limitation mentionned in the article is that predicate can only be
unary or binary. This is quite limiting. How can the factor graph idea be
generalized to larger arity ?
—
You are receiving this because you are subscribed to this thread.
Reply to this email directly, view it on GitHub
<#2>, or mute the thread
<https://github.com/notifications/unsubscribe-auth/AB8-Sx_R4sFYmeiWE2PlO9_q6HLmmiuAks5rcwZegaJpZM4MBwRO>
.
Very interesting work, thank you.
One limitation mentionned in the article is that predicate can only be unary or binary. This is quite limiting. How can the factor graph idea be generalized to larger arity ?
The text was updated successfully, but these errors were encountered: