Table 2
Comparison between SCN and SAN.
k
is the kernel number of convolutions.
n
is
max
(
n
u
,
n
r
).
d
is the embedding size.
.
time complexity
.
number of sequential operations
.
SCN
𝒪(
k
⋅
n
⋅
d
2
+
n
⋅
d
2
+
n
2
⋅
d
)
n
SAN
𝒪(
n
2
⋅
d
2
+
n
2
⋅
d
)
2
n
.
time complexity
.
number of sequential operations
.
SCN
𝒪(
k
⋅
n
⋅
d
2
+
n
⋅
d
2
+
n
2
⋅
d
)
n
SAN
𝒪(
n
2
⋅
d
2
+
n
2
⋅
d
)
2
n
View Large
Close Modal
Close Modal
This Feature Is Available To Subscribers Only
Sign In
or
Create an Account
Close Modal
Close Modal
This site uses cookies. By continuing to use our website, you are agreeing to
our privacy policy.
No content on this site may be used to train artificial intelligence systems without permission in writing from the MIT Press.
Accept