Sciweavers

7055 search results - page 322 / 1411
» Some New 4-Designs
Sort
View
CORR
2008
Springer
129views Education» more  CORR 2008»
15 years 6 months ago
Bounds on Codes Based on Graph Theory
"THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD" Let Aq(n, d) be the maximum order (maximum number of codewords) of a q-ary code of length n and Hamming distance at l...
Salim Y. El Rouayheb, Costas N. Georghiades, Emina...
ALGORITHMICA
2006
84views more  ALGORITHMICA 2006»
15 years 6 months ago
Large Deviations for the Weighted Height of an Extended Class of Trees
We use large deviations to prove a general theorem on the asymptotic edge-weighted height Hn of a large class of random trees for which Hn c log n for some positive constant c. A...
Nicolas Broutin, Luc Devroye
ENDM
2008
93views more  ENDM 2008»
15 years 6 months ago
The Generalized Max-Controlled Set Problem
In this work we deal with sandwich graphs G = (V, E) and present the notion of vertices f-controlled by a subset M V . We introduce the generalized maxcontrolled set problem (gmc...
Ivairton M. Santos, Carlos A. J. Martinhon, Luiz S...
ENGL
2008
82views more  ENGL 2008»
15 years 6 months ago
Teachers' Views on Conducting Formative Assessment in Chinese Context
- A new system of curriculum evaluation of formative assessment has been established in secondary education system in China for seven years. Attention has been given to teaching an...
Xuefeng Wang
COMBINATORICS
2006
123views more  COMBINATORICS 2006»
15 years 6 months ago
The Non-Crossing Graph
Two sets are non-crossing if they are disjoint or one contains the other. The noncrossing graph NCn is the graph whose vertex set is the set of nonempty subsets of [n] = {1, . . ....
Nathan Linial, Michael E. Saks, David Statter