JMLR
2010
12 years 11 months ago
2010
In this paper we learn a dissimilarity measure for categorical data, for effective classification of the data points. Each categorical feature (with values taken from a finite set...
JGT
2011
12 years 11 months ago
2011
A graph G = (V, E) is called (k, k )-total weight choosable if the following holds: For any total list assignment L which assigns to each vertex x a set L(x) of k real numbers, an...
JCSS
2011
12 years 11 months ago
2011
Abstract. We show how to represent an interval of real numbers in an abstract numeration system built on a language that is not necessarily regular. As an application, we consider ...
MLQ
2002
13 years 4 months ago
2002
For the computability of subsets of real numbers, several reasonable notions have been suggested in the literature. We compare these notions in a systematic way by relating them to...
MLQ
2002
13 years 4 months ago
2002
A real number is recursively approximable if there is a computable sequence of rational numbers converging to it. If some extra condition to the convergence is added, then the limi...
JUCS
2002
13 years 4 months ago
2002
: We consider disjunctive sequences, that is, infinite sequences (-words) having all finite words as infixes. It is shown that the set of all disjunctive sequences can be described...
JSYML
2002
13 years 4 months ago
2002
Abstract. This paper develops the very basic notions of analysis in a weak secondorder theory of arithmetic BTFA whose provably total functions are the polynomial time computable f...
JCSS
2002
13 years 4 months ago
2002
We study two fundamental problems concerning the search for interesting regions in sequences: (i) given a sequence of real numbers of length n and an upper bound U; find a consecu...
JCT
2000
13 years 4 months ago
2000
We answer a question posed by Lampert and Slater [7]. Consider a sequence of real numbers qn in the interval [0, 1] defined by q0 = 0, q1 = 1, and, for n 1, qn+1 equals an averag...
JC
2000
13 years 4 months ago
2000
The Turing degree of a real number x is defined as the Turing degree of its binary expansion. This definition is quite natural and robust. In this paper we discuss some basic degr...