14518 search results - page 2621 / 2904 » Two Problems for Sophistication |
147
click to vote
JCT
1998
15 years 4 months ago
1998
Let Q(N) denote the number of partitions of N into distinct parts. If ω(k) := 3k2 +k 2 , then it is well known that Q(N) + ∞X k=1 (−1)k “ Q(N − 2ω(k)) + Q(N − 2ω(−k)...
134
Voted
TC
1998
15 years 4 months ago
1998
In a computer network that consists of M subnetworks, the L-bit address of a machine consists of two parts: A pre x si that contains the address of the subnetwork to which the mac...
142
Voted
SIGCSE
2002
ACM
15 years 4 months ago
2002
ACM
This paper reports on the implication of different preferred learning styles on students'performance in the introductory programming sequence and on work in progress on how t...
154
Voted
TPDS
1998
15 years 4 months ago
1998
—Increasingly larger data sets are being stored in networked architectures. Many of the available data structures are not easily amenable to parallel realizations. Hashing scheme...
136
click to vote
TIT
2002
15 years 4 months ago
2002
Abstract--Two-dimensional interleaving schemes with repetitions are considered. These schemes are required for the correction of two-dimensional bursts (or clusters) of errors in a...