Sciweavers

19700 search results - page 6 / 3940
» DNA-Based Computation Times
Sort
View
TAL
2010
Springer
14 years 6 months ago
A Formal Ontology for a Computational Approach of Time and Aspect
This paper provides a linguistic semantic analysis of time and aspect in natural languages. On the basis of topological concepts, notions are introduced like the basic aspectual op...
Aurelien Arena, Jean-Pierre Desclés
WWW
2011
ACM
14 years 6 months ago
A word at a time: computing word relatedness using temporal semantic analysis
Computing the degree of semantic relatedness of words is a key functionality of many language applications such as search, clustering, and disambiguation. Previous approaches to c...
Kira Radinsky, Eugene Agichtein, Evgeniy Gabrilovi...
77
Voted
TCS
1998
14 years 11 months ago
Dynamical Recognizers: Real-Time Language Recognition by Analog Computers
We consider a model of analog computation which can recognize various languages in real time. We encode an input word as a point in Rd by composing iterated maps, and then apply i...
Cristopher Moore
SIAMNUM
2010
106views more  SIAMNUM 2010»
14 years 6 months ago
Computing Sacker-Sell spectra in Discrete Time Dynamical Systems
In this paper we develop boundary value methods for detecting Sacker-Sell spectra in discrete time dynamical systems. The algorithms are advancements of earlier methods for comput...
Thorsten Hüls
IWOCA
2010
Springer
232views Algorithms» more  IWOCA 2010»
14 years 6 months ago
Computing Role Assignments of Proper Interval Graphs in Polynomial Time
A homomorphism from a graph G to a graph R is locally surjective if its restriction to the neighborhood of each vertex of G is surjective. Such a homomorphism is also called an R-r...
Pinar Heggernes, Pim van 't Hof, Daniël Paulu...