40 search results - page 1 / 8 » The Jump Classes of Minimal Covers |
CIE
2006
Springer
13 years 8 months ago
2006
Springer
We work in D[< 0 ]. Given the jump class of any (Turing) degree a, the jump classes of the minimal covers of a is a matter which is entirely settled unless a is high2. We show t...
ISAAC
2010
Springer
13 years 2 months ago
2010
Springer
The concept of neighbor system, introduced by Hartvigsen (2009), is a set of integral vectors satisfying a certain combinatorial property. In this paper, we reveal the relationship...
JMLR
2006
13 years 4 months ago
2006
We study some stability properties of algorithms which minimize (or almost-minimize) empirical error over Donsker classes of functions. We show that, as the number n of samples gr...
TIT
1998
13 years 4 months ago
1998
—We investigate a new class of codes for the optimal covering of vertices in an undirected graph Gsuch that any vertex in G can be uniquely identified by examining the vertices ...
DAM
1999
13 years 4 months ago
1999
The definitions of four previously studied parameters related to total coverings and total matchings of graphs can be restricted, thereby obtaining eight parameters related to cov...