Sciweavers

2356 search results - page 60 / 472
» Characterizations of postman sets
Sort
View
BSL
2000
153views more  BSL 2000»
14 years 11 months ago
Combinatorics with definable sets: Euler characteristics and Grothendieck rings
We recall the notions of weak and strong Euler characteristics on a first order structure and make explicit the notion of a Grothendieck ring of a structure. We define partially or...
Jan Krajícek, Thomas Scanlon
CORR
2010
Springer
136views Education» more  CORR 2010»
14 years 12 months ago
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases
This article studies the expressive power of finite automata recognizing sets of real numbers encoded in positional notation. We consider Muller automata as well as the restricted ...
Bernard Boigelot, Julien Brusten, Véronique...
FSTTCS
2010
Springer
14 years 10 months ago
The effect of girth on the kernelization complexity of Connected Dominating Set
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...
Neeldhara Misra, Geevarghese Philip, Venkatesh Ram...
BMCBI
2010
190views more  BMCBI 2010»
15 years 5 hour ago
Sample size and statistical power considerations in high-dimensionality data settings: a comparative study of classification alg
Background: Data generated using `omics' technologies are characterized by high dimensionality, where the number of features measured per subject vastly exceeds the number of...
Yu Guo, Armin Graber, Robert N. McBurney, Raji Bal...
FOCI
2007
IEEE
15 years 6 months ago
Why Intervals? Why Fuzzy Numbers? Towards a New Justification
The purpose of this paper is to present a new characterization of the set of all intervals (and of the corresponding set of fuzzy numbers). This characterization is based on sever...
Vladik Kreinovich