3299 search results - page 76 / 660 » A general mathematics of names |
165
click to vote
OPODIS
2008
15 years 7 months ago
2008
We study the group renaming problem, which is a natural generalization of the renaming problem. An instance of this problem consists of n processors, partitioned into m groups, ea...
191
click to vote
CASC
2009
Springer
16 years 23 days ago
2009
Springer
We discuss the family of “divide-and-conquer” algorithms for polynomial multiplication, that generalize Karatsuba’s algorithm. We give explicit versions of transposed and sho...
117
click to vote
ISIPTA
1999
IEEE
15 years 10 months ago
1999
IEEE
Inferential problems that arise in the empirical analysis oftreatmentresponseinduceambiguityabouttheidentity of optimal treatment rules. This paper describes a research program th...
170
click to vote
ISSAC
1993
Springer
15 years 10 months ago
1993
Springer
Hypergeometric sequences are such that the quotient of two successive terms is a fixed rational function of the index. We give a generalization of M. Petkov6ek’s algorithm to fi...
154
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Using the concept of discrete noiseless channels, it was shown by Shannon in A Mathematical Theory of Communication that the ultimate performance of an encoder for a constrained sy...