Sciweavers

1410 search results - page 248 / 282
» Proving theorems by reuse
Sort
View
CORR
2011
Springer
162views Education» more  CORR 2011»
13 years 4 months ago
Helly numbers of acyclic families
The Helly number of a family of sets with empty intersection is the size of its largest inclusionwise minimal sub-family with empty intersection. Let F be a finite family of open...
Éric Colin de Verdière, Grégo...
DM
2011
223views Education» more  DM 2011»
13 years 4 months ago
On graph equivalences preserved under extensions
Let G be the set of finite graphs whose vertices belong to some fixed countable set, and let ≡ be an equivalence relation on G. By the strengthening of ≡ we mean an equivalen...
Zbigniew Lonc, Miroslaw Truszczynski
JCT
2011
62views more  JCT 2011»
13 years 4 months ago
Anti-lecture hall compositions and overpartitions
We show that the number of anti-lecture hall compositions of n with the first entry not exceeding k − 2 equals the number of overpartitions of n with non-overlined parts not con...
William Y. C. Chen, Doris D. M. Sang, Diane Y. H. ...
JVCIR
2011
96views more  JVCIR 2011»
13 years 4 months ago
Stabilization and optimization of PLUS factorization and its application in image coding
A recently developed PLUS factorization holds great promise in image coding due to its simplicity and integer reversibility. However, existing PLUS factorizations did not consider...
Lei Yang, Pengwei Hao, Dapeng Wu
TCOM
2011
129views more  TCOM 2011»
13 years 4 months ago
On the Capacity of WDM Passive Optical Networks
—To lower costs, WDM PONs may share the usage of wavelengths, transmitters, and receivers among ONUs, instead of dedicating the transmission between OLT and each ONU with one ind...
Jingjing Zhang, Nirwan Ansari