Sciweavers

395 search results - page 2 / 79
» Decision Problems for Convex Languages
Sort
View
DLT
2010
13 years 6 months ago
Computing Blocker Sets for the Regular Post Embedding Problem
Abstract. Blocker and coblocker sets are regular languages involved in the algorithmic solution of the Regular Post Embedding Problem. We investigate the computability of these lan...
Pierre Chambart, Philippe Schnoebelen
CDC
2009
IEEE
126views Control Systems» more  CDC 2009»
13 years 6 months ago
Support vector machine classifiers for sequential decision problems
Classification problems in critical applications such as health care or security often require very high reliability because of the high costs of errors. In order to achieve this r...
Eladio Rodriguez Diaz, David A. Castaon
NIPS
2001
13 years 6 months ago
K-Local Hyperplane and Convex Distance Nearest Neighbor Algorithms
Guided by an initial idea of building a complex (non linear) decision surface with maximal local margin in input space, we give a possible geometrical intuition as to why K-Neares...
Pascal Vincent, Yoshua Bengio
UM
2005
Springer
13 years 10 months ago
Decision Theoretic Dialogue Planning for Initiative Problems
The taking of initiative has significance in spoken language dialogue systems and in human-computer interaction. A system that takes no initiative may fail to seize opportunities ...
Bryan McEleney, Gregory M. P. O'Hare
IJCAI
2007
13 years 6 months ago
The Design of ESSENCE: A Constraint Language for Specifying Combinatorial Problems
ESSENCE is a new formal language for specifying combinatorial problems in a manner similar to natural rigorous specifications that use a mixture of natural language and discrete ...
Alan M. Frisch, Matthew Grum, Christopher Jefferso...