1604 search results - page 197 / 321 » Regularization on Discrete Spaces |
ACMSE
2006
ACM
14 years 4 months ago
2006
ACM
Classic results in the theory of regular languages show that the problem of converting an NFA (nondeterministic finite automaton) into a minimal equivalent NFA is NP-hard, even f...
IFIP
2004
Springer
14 years 3 months ago
2004
Springer
Abstract In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Wei...
KR
2004
Springer
14 years 3 months ago
2004
Springer
To support commonsense reasoning about space, we require a qualitative calculus of spatial entities and their relations. One requirement for such a calculus, which has not so far ...
MDM
2004
Springer
14 years 3 months ago
2004
Springer
The decoupling of producers and consumers in time and space in the publish/subscribe paradigm lends itself well to the support of mobile users who roam about the environment and h...
VOSS
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. This paper describes symbolic techniques for the construction, representation and analysis of large, probabilistic systems. Symbolic approaches derive their efficiency by...