198 search results - page 6 / 40 » Tensor Rank: Some Lower and Upper Bounds |
176
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Let S = {si}iIN IN be a numerical semigroup. For si S, let (si) denote the number of pairs (si -sj, sj) S2 . When S is the Weierstrass semigroup of a family {Ci}iIN of one-point...
167
click to vote
JCT
2011
15 years 1 months ago
2011
We find sharp absolute constants C1 and C2 with the following property: every well-rounded lattice of rank 3 in a Euclidean space has a minimal basis so that the solid angle spann...
170
click to vote
STOC
2002
ACM
16 years 7 months ago
2002
ACM
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
171
click to vote
COCOON
2009
Springer
16 years 1 months ago
2009
Springer
This paper explores the fundamental question of how many iterations the celebrated HITS algorithm requires on a general graph to converge in score and, perhaps more importantly, in...
177
click to vote
COLT
2007
Springer
16 years 24 days ago
2007
Springer
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose there ...