Results 1  10
of
11,460
Compositions with m Distinct Parts
 Aequationes Mathematicae
, 1996
"... We study F (n; m), the number of compositions of n in which repetition of parts is allowed, but exactly m distinct parts are used. We obtain explicit formulas, recurrence relations, and generating functions for F (n; m) and for auxiliary functions related to F . We also consider the analogous fun ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
We study F (n; m), the number of compositions of n in which repetition of parts is allowed, but exactly m distinct parts are used. We obtain explicit formulas, recurrence relations, and generating functions for F (n; m) and for auxiliary functions related to F . We also consider the analogous
THE ARITHMETIC OF PARTITIONS INTO DISTINCT PARTS
"... A partition of the positive integer n into distinct parts is a decreasing sequence of positive integers whose sum is n, and the number of such partitions is denoted by Q(n). If we adopt the convention that Q(0) = 1, then we have the generating function ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
A partition of the positive integer n into distinct parts is a decreasing sequence of positive integers whose sum is n, and the number of such partitions is denoted by Q(n). If we adopt the convention that Q(0) = 1, then we have the generating function
DIVISIBILITY AND DISTRIBUTION OF PARTITIONS INTO DISTINCT PARTS
"... Abstract. We study the generating function for Q(n), the number of partitions of a natural number n into distinct parts. Using the arithmetic properties of Fourier coefficients of integer weight modular forms, we prove several theorems on the divisibility and distribution of Q(n) modulo primes p ≥ 5 ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Abstract. We study the generating function for Q(n), the number of partitions of a natural number n into distinct parts. Using the arithmetic properties of Fourier coefficients of integer weight modular forms, we prove several theorems on the divisibility and distribution of Q(n) modulo primes p
The Sum Of Distinct Parts In Compositions And Partitions
 Department of Mathematics West Virginia University, Morgantown WV
, 1998
"... We study ^ F (n; m) [ ^ G(n; m)], the number of compositions [partitions] of n in which repetition of parts is allowed, but the sum of distinct parts is m. We obtain generating functions for xed m as well as formulas and asymptotic estimates for the mean values of ^ F and ^ G. Partitions and compos ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
We study ^ F (n; m) [ ^ G(n; m)], the number of compositions [partitions] of n in which repetition of parts is allowed, but the sum of distinct parts is m. We obtain generating functions for xed m as well as formulas and asymptotic estimates for the mean values of ^ F and ^ G. Partitions
A.: Blocks that shout: Distinctive parts for scene classification
, 2013
"... The automatic discovery of distinctive parts for an object or scene class is challenging since it requires simultaneously to learn the part appearance and also to identify the part occurrences in images. In this paper, we propose a simple, efficient, and effective method to do so. We address this ..."
Abstract

Cited by 52 (1 self)
 Add to MetaCart
The automatic discovery of distinctive parts for an object or scene class is challenging since it requires simultaneously to learn the part appearance and also to identify the part occurrences in images. In this paper, we propose a simple, efficient, and effective method to do so. We ad
A Survey of Program Slicing Techniques
 JOURNAL OF PROGRAMMING LANGUAGES
, 1995
"... A program slice consists of the parts of a program that (potentially) affect the values computed at some point of interest, referred to as a slicing criterion. The task of computing program slices is called program slicing. The original definition of a program slice was presented by Weiser in 197 ..."
Abstract

Cited by 790 (10 self)
 Add to MetaCart
A program slice consists of the parts of a program that (potentially) affect the values computed at some point of interest, referred to as a slicing criterion. The task of computing program slices is called program slicing. The original definition of a program slice was presented by Weiser
A Note on Partitions Into Distinct Parts and Odd Parts
, 1999
"... . BousquetMelou and Eriksson showed that the number of partitions of n into distinct parts whose alternating sum is k is equal to the number of partitions of n into k odd parts, which is a refinement of a wellknown result by Euler. We give a di#erent graphical interpretation of the bijection by Sy ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
. BousquetMelou and Eriksson showed that the number of partitions of n into distinct parts whose alternating sum is k is equal to the number of partitions of n into k odd parts, which is a refinement of a wellknown result by Euler. We give a di#erent graphical interpretation of the bijection
Maximum Product Over Partitions Into Distinct Parts
, 2005
"... We establish an explicit formula for the maximum value of the product of parts for partitions of a positive integer into distinct parts (sequence A034893 in the OnLine Encyclopedia of Integer Sequences). ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We establish an explicit formula for the maximum value of the product of parts for partitions of a positive integer into distinct parts (sequence A034893 in the OnLine Encyclopedia of Integer Sequences).
Combining labeled and unlabeled data with cotraining
, 1998
"... We consider the problem of using a large unlabeled sample to boost performance of a learning algorithm when only a small set of labeled examples is available. In particular, we consider a setting in which the description of each example can be partitioned into two distinct views, motivated by the ta ..."
Abstract

Cited by 1633 (28 self)
 Add to MetaCart
We consider the problem of using a large unlabeled sample to boost performance of a learning algorithm when only a small set of labeled examples is available. In particular, we consider a setting in which the description of each example can be partitioned into two distinct views, motivated
Maximum Product Over Partitions Into Distinct Parts
"... We establish an explicit formula for the maximum value of the product of parts for partitions of a positive integer into distinct parts (sequence A034893 in the OnLine Encyclopedia of Integer Sequences). 1 ..."
Abstract
 Add to MetaCart
We establish an explicit formula for the maximum value of the product of parts for partitions of a positive integer into distinct parts (sequence A034893 in the OnLine Encyclopedia of Integer Sequences). 1
Results 1  10
of
11,460