787 search results - page 71 / 158 » Polynomial Constants are Decidable |
DAGSTUHL
2007
13 years 10 months ago
2007
Abstract. Moving objects produce trajectories, which are stored in databases by means of finite samples of time-stamped locations. When also speed limitations in these sample poin...
TCS
2008
13 years 9 months ago
2008
Formalized study of self-assembly has led to the definition of the tile assembly model, a highly distributed parallel model of computation that may be implemented using molecules ...
AI
2002
Springer
13 years 9 months ago
2002
Springer
Most classification algorithms are "passive", in that they assign a class label to each instance based only on the description given, even if that description is incompl...
LATA
2009
Springer
14 years 4 months ago
2009
Springer
We examine decision problems for various classes of convex languages, previously studied by Ang and Brzozowski under the name “continuous languages”. We can decide whether a la...
LICS
2009
IEEE
14 years 3 months ago
2009
IEEE
—We associate a statistical vector to a trace and a geometrical embedding to a Markov Decision Process, based on a distance on words, and study basic Membership and Equivalence p...