Sciweavers

11949 search results - page 167 / 2390
» Some results on (a:b)-choosability
Sort
View
AML
2008
85views more  AML 2008»
15 years 1 months ago
A hierarchy of hereditarily finite sets
This article defines a hierarchy on the hereditarily finite sets which reflects the way sets are built up from the empty set by repeated adjunction, the addition to an already exis...
Laurence Kirby
CORR
2010
Springer
113views Education» more  CORR 2010»
15 years 1 months ago
Game semantics for first-order logic
We refine HO/N game semantics with an additional notion of pointer (mu-pointers) and extend it to first-order classical logic with completeness results. We use a Church style exte...
Olivier Laurent
CORR
2008
Springer
70views Education» more  CORR 2008»
15 years 1 months ago
Necessary Conditions for Discontinuities of Multidimensional Size Functions
Some new results about multidimensional Topological Persistence are presented, proving that the discontinuity points of a k-dimensional size function are necessarily related to the...
Andrea Cerri, Patrizio Frosini
ENDM
2010
100views more  ENDM 2010»
15 years 1 months ago
Balanced list edge-colourings of bipartite graphs
Galvin solved the Dinitz conjecture by proving that bipartite graphs are -edge-choosable. We employ Galvin's method to show some further list edgecolouring properties of bipa...
Tamás Fleiner, András Frank
ALMOB
2006
86views more  ALMOB 2006»
15 years 1 months ago
Analysis of computational approaches for motif discovery
Recently, we performed an assessment of 13 popular computational tools for discovery of transcription factor binding sites (M. Tompa, N. Li, et al., "Assessing Computational ...
Nan Li, Martin Tompa