104 search results - page 4 / 21 » On a special class of primitive words |
SIAMJO
2008
13 years 7 months ago
2008
For the problem of solving maximal monotone inclusions, we present a rather general class of algorithms, which contains hybrid inexact proximal point methods as a special case and ...
CSR
2007
Springer
14 years 1 months ago
2007
Springer
Traditionally, data that has both linear and hierarchical structure, such as annotated linguistic data, is modeled using ordered trees and queried using tree automata. In this pap...
COLING
1992
13 years 8 months ago
1992
This paper describes a program that disambignates English word senses in unrestricted text using statistical models of the major Roget's Thesaurus categories. Roget's ca...
ICALP
2010
Springer
14 years 4 days ago
2010
Springer
Abstract. This paper tackles three algorithmic problems for probabilistic automata on finite words: the Emptiness Problem, the Isolation Problem and the Value 1 Problem. The Empti...
ICRA
1998
IEEE
13 years 11 months ago
1998
IEEE
The subject of this paper is a special class of closedchain manipulators. First, we analyze a family of twodegree-of-freedom (dof) five-bar planar linkages. Two Jacobian matrices ...