1220 search results - page 25 / 244 » Restricting grammatical complexity |
90
Voted
SIGDIAL
2010
15 years 19 days ago
2010
We point out several problems in scalingup statistical approaches to spoken dialogue systems to enable them to deal with complex but natural user goals, such as disjunctive and ne...
201
Voted
IWPEC
2010
Springer
15 years 20 days ago
2010
Springer
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
96
Voted
JCIT
2008
15 years 2 months ago
2008
In this paper we deal with the Landau-LifshitzGilbert equation which describes dynamics of ferromagnetism. Based on the strong nonlinearities a stabilised discretisation method is...
209
Voted
APAL
2011
14 years 9 months ago
2011
The terms of the upper and lower central series of a nilpotent computable group have computably enumerable Turing degree. We show that the Turing degrees of these terms are indepe...
119
Voted
APPROX
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. Combinatorial property testing deals with the following relaxation of decision problems: Given a fixed property and an input x, one wants to decide whether x satisfies th...