101 search results - page 18 / 21 » General Algorithms for Testing the Ambiguity of Finite Autom... |
ECAI
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. This paper describes an experimental comparison between two standard supervised learning methods, namely Naive Bayes and Exemplar–basedclassification, on the Word Sens...
ICPR
2000
IEEE
14 years 8 months ago
2000
IEEE
We present a very simple and effective method for eliminating the degeneracy inherent in a planar scene, and demonstrate its performance in a useful application -- that of binocul...
DAM
2008
13 years 7 months ago
2008
Polar graphs are a common generalization of bipartite, cobipartite, and split graphs. They are defined by the existence of a certain partition of vertices, which is NPcomplete to ...
CONCUR
2008
Springer
13 years 9 months ago
2008
Springer
We present an algorithm for partial order reduction in the context of a countable universe of deterministic actions, of which finitely many are enabled at any given state. This mea...
CIKM
2003
Springer
14 years 17 days ago
2003
Springer
Most cross language information retrieval research concentrates on language pairs for which direct, rich, and often multiple translation resources already exist. However, for most...