Sciweavers

6719 search results - page 67 / 1344
» A Generalization of Automatic Sequences
Sort
View
COLING
2002
13 years 8 months ago
SOAT: A Semi-Automatic Domain Ontology Acquisition Tool from Chinese Corpus
In this paper, we focus on the domain ontology acquisition from Chinese corpus by extracting rules designed for Chinese phrases. These rules are noun sequences with part-of-speech...
Shih-Hung Wu, Wen-Lian Hsu
DMTCS
2007
99views Mathematics» more  DMTCS 2007»
13 years 8 months ago
Latin Square Thue-Morse Sequences are Overlap-Free
We define a morphism based upon a Latin square that generalizes the Thue-Morse morphism. We prove that fixed points of this morphism are overlap-free sequences, generalizing resu...
Christopher Robinson Tompkins
ICIP
2003
IEEE
14 years 10 months ago
Towards objective performance analysis for estimation of complex motion: analytic motion modeling, filter optimization, and test
This paper deals with several aspects towards a more objective performance analysis of low-level motion analysis. A generalized spatiotemporal filter formulation and motion modeli...
Bernd Jähne, Christoph S. Garbe
GECCO
2008
Springer
143views Optimization» more  GECCO 2008»
13 years 10 months ago
Enhanced generalized ant programming (EGAP)
This paper begins by reviewing different methods of automatic programming while emphasizing the technique of Ant Programming (AP). AP uses an ant foraging metaphor in which ants g...
Amirali Salehi-Abari, Tony White
RECOMB
2003
Springer
14 years 9 months ago
Finding recurrent sources in sequences
Many genomic sequences and, more generally, (multivariate) time series display tremendous variability. However, often it is reasonable to assume that the sequence is actually gene...
Aristides Gionis, Heikki Mannila