198 search results - page 14 / 40 » Tensor Rank: Some Lower and Upper Bounds |
ICLP
2007
Springer
15 years 2 months ago
2007
Springer
We present a static analysis that infers both upper and lower bounds on the usage that a logic program makes of a set of user-definable resources. The inferred bounds will in gener...
CRYPTO
2006
Springer
15 years 1 months ago
2006
Springer
In this paper we formalize a general model of cryptanalytic time/memory tradeoffs for the inversion of a random function f : {0, 1, . . . , N - 1} {0, 1, . . . , N - 1}. The model...
SIGECOM
2005
ACM
15 years 3 months ago
2005
ACM
We determine the communication complexity of the common voting rules. The rules (sorted by their communication complexity from low to high) are plurality, plurality with runoff, ...
ICSOC
2009
Springer
14 years 7 months ago
2009
Springer
Several activities in service oriented computing can benefit from knowing ahead of time future properties of a given service composition. In this paper we focus on how statically i...
TIT
1998
14 years 9 months ago
1998
— The lower and upper bounds for the information capacity of two-layer feedforward neural networks with binary interconnections, integer thresholds for the hidden units, and zero...