A modification over Sakoe and Chiba's dynamic time warping algorithm for isolated word recognition is proposed. It is shown that this modified algorithm works better without any slope constraint. Also, this algorithm not only consumes less computation time but also improves the word recognition accuracy.

We study the complexity of constraint satisfaction problems for templates Γ that are firstorder definable in (Z; succ), the integers with the successor relation. In the case that Γ is locally finite (i.e., the Gaifman graph of Γ has finite degree), we show that Γ is homomorphically equivalent to a structure with a certain majority polymorphism (which we call modular median) and the CSP for Γ ca...

The minimum unsatisfiability version of a constraint satisfaction problem (MinCSP) asks for an assignment where the number of unsatisfied constraints is minimum possible, or equivalently, asks for a minimum-size set of constraints whose deletion makes the instance satisfiable. For a finite set Γ of constraints, we denote by MinCSP(Γ) the restriction of the problem where each constraint is from ...

A binary constraints network consists of a set of n variables, defined on domains of size at most d, and a set of e binary constraints. The binary constraint satisfaction problem consists in finding a solution for a binary constraints network, that is an instantiation of all the variables which satisfies all the constraints. A value a in the domain of variable x is inconsistent if there is no s...

We study 2-ary constraint satisfaction problems (2-CSPs), which can be stated as follows: given a constraint graph G = (V,E), an alphabet set Σ and, for each edge {u, v} ∈ E, a constraint Cuv ⊆ Σ× Σ, the goal is to find an assignment σ : V → Σ that satisfies as many constraints as possible, where a constraint Cuv is said to be satisfied by σ if (σ(u), σ(v)) ∈ Cuv. While the approximability of 2...

‎in this paper, using the idea of convexificators, we study boundedness and nonemptiness of lagrange multipliers satisfying the first order necessary conditions. we consider a class of nons- mooth fractional programming problems with equality, inequality constraints and an arbitrary set constraint. within this context, define generalized mangasarian-fromovitz constraint qualification and show t...

the aim of this study is to carry out an empirical study of constraint factors in recreational sporting activities. more specifically it tests the model of constraints (intra-personal, interpersonal, and structural), as proposed by crawford et al. (1991), and its relationship with actual participation levels in specific recreational sports activities in iran. although there is a growing body o...

In a valued constraint satisfaction problem (VCSP), the goal is to find an assignment of labels to variables that minimizes a given sum of functions. Each function in the sum depends on a subset of variables, takes values which are rational numbers or infinity, and is chosen from a fixed finite set of functions called a constraint language. The case when all functions take only values 0 and inf...

It is well known that the constraint satisfaction problem over a general relational structure A is polynomial time equivalent to the constraint problem over some associated digraph. We present a variant of this construction and show that the corresponding constraint satisfaction problem is logspace equivalent to that over A. Moreover, we show that almost all of the commonly encountered polymorp...