825 search results - page 6 / 165 » Partitions of an Integer into Powers |
EJC
2008
13 years 7 months ago
2008
Given the set [n] = {1, . . . , n} for positive integer n, combinatorial properties of Clifford algebras are exploited to count partitions and nonoverlapping partitions of [n]. Th...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We introduce two algorithms for accurately evaluating powers to a positive integer in floating-point arithmetic, assuming a fused multiply-add (fma) instruction is available. We ...
INFOCOM
2003
IEEE
14 years 19 days ago
2003
IEEE
— Wireless multicast/broadcast sessions, unlike wired networks, inherently reaches several nodes with a single transmission. For omnidirectional wireless broadcast to a node, all...
CIE
2010
Springer
13 years 11 months ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
GLVLSI
2006
IEEE
14 years 1 months ago
2006
IEEE