Sciweavers

Share
JMLR
2010
230views more  JMLR 2010»
9 years 20 days ago
Learning Dissimilarities for Categorical Symbols
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...
Jierui Xie, Boleslaw K. Szymanski, Mohammed J. Zak...
JGT
2011
109views more  JGT 2011»
9 years 26 days ago
Total weight choosability of graphs
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...
Tsai-Lien Wong, Xuding Zhu
JCSS
2011
81views more  JCSS 2011»
9 years 26 days ago
Representing real numbers in a generalized numeration system
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 ...
Emilie Charlier, Marion Le Gonidec, Michel Rigo
MLQ
2002
74views more  MLQ 2002»
9 years 5 months ago
Computability on Regular Subsets of Euclidean Space
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...
Martin Ziegler
MLQ
2002
75views more  MLQ 2002»
9 years 5 months ago
Recursive Approximability of Real Numbers
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...
Xizhong Zheng
JUCS
2002
90views more  JUCS 2002»
9 years 5 months ago
How Large is the Set of Disjunctive Sequences?
: 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...
Ludwig Staiger
JSYML
2002
92views more  JSYML 2002»
9 years 5 months ago
Groundwork for Weak Analysis
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...
António M. Fernandes, Fernando Ferreira
JCSS
2002
95views more  JCSS 2002»
9 years 5 months ago
Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis
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...
Yaw-Ling Lin, Tao Jiang, Kun-Mao Chao
JCT
2000
91views more  JCT 2000»
9 years 5 months ago
Averaging Sequences, Deranged Mappings, and a Problem of Lampert and Slater
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...
Neil J. Calkin, E. Rodney Canfield, Herbert S. Wil...
JC
2000
89views more  JC 2000»
9 years 5 months ago
Weakly Computable Real Numbers
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...
Klaus Ambos-Spies, Klaus Weihrauch, Xizhong Zheng
books