An arc-annotated string is a string of characters, called bases, augmented with a set of pairs, called arcs, each connecting two bases. Given arc-annotated strings P and Q the arc-...
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsen...
It is generally assumed that touch input cannot be accurate because of the fat finger problem, i.e., the softness of the fingertip combined with the occlusion of the target by the...
The usage of network resources by content providers is commonly governed by Service Level Agreements (SLA) between the content provider and the network service provider. Resource ...
Abstract. One of the most widely applied techniques to deal with multiclass categorization problems is the pairwise voting procedure. Recently, this classical approach has been emb...