Sciweavers

6719 search results - page 34 / 1344
» A Generalization of Automatic Sequences
Sort
View
DAM
2010
89views more  DAM 2010»
13 years 8 months ago
A note on the hardness of Skolem-type sequences
The purpose of this note is to give upper bounds (assuming P different from NP) on how far the generalizations of Skolem sequences can be taken while still hoping to resolve the ex...
Gustav Nordh
DLOG
2008
13 years 11 months ago
Planning of Axiom Absorption
Absorptions are generally employed in Description Logics (DL) reasoners in a uniform way regardless of the structure of an input knowledge base. In this paper we present an approac...
Jiewen Wu, Volker Haarslev
CSB
2005
IEEE
223views Bioinformatics» more  CSB 2005»
14 years 2 months ago
Automatic Protein Function Annotation through Candidate Ortholog Clusters from Incomplete Genomes
Annotation of protein function often arises in the context of partially complete genomes but is not adequately addressed. We present an annotation method by extracting ortholog cl...
Akshay Vashist, Casimir A. Kulikowski, Ilya B. Muc...
ADCM
2007
168views more  ADCM 2007»
13 years 8 months ago
A generalization of Gram-Schmidt orthogonalization generating all Parseval frames
Given an arbitrary finite sequence of vectors in a finite–dimensional Hilbert space, we describe an algorithm, which computes a Parseval frame for the subspace generated by the...
Peter G. Casazza, Gitta Kutyniok
IJON
2008
73views more  IJON 2008»
13 years 8 months ago
Third-order generalization: A new approach to categorizing higher-order generalization
Generalization, in its most basic form, is an artificial neural network's (ANN's) ability to automatically classify data that were not seen during training. This paper p...
Richard Neville