MOTIVATION A tool that simultaneously aligns multiple protein sequences, automatically utilizes information about protein domains, and has a good compromise between speed and accuracy will have practical advantages over current tools. RESULTS We describe COBALT, a constraint based alignment tool that implements a general framework for multiple alignment of protein sequences. COBALT finds a co...

We show a simple method for constructing an infinite family of graph formation games with link bias so that the resulting games admits, as a pairwise stable solution, a graph with an arbitrarily specified degree distribution. Pairwise stability is used as the equilibrium condition over the more commonly used Nash equilibrium to prevent the occurrence of ill-behaved equilibrium strategies that d...

Unit quaternion is an ideal parameterization for joint rotations. However, due to the complexity of the geometry of S group, it’s hard to specify meaningful joint constraints with unit quaternion. In this paper, we have proposed an effective and accurate method to specify the rotation limits for joints parameterized with the unit quaternion. Joint constrains constructed with our method are adeq...

Our system treats coreference resolution as an integer linear programming (ILP) problem. Extending Denis and Baldridge (2007) and Finkel andManning (2008)’s work, we exploit loose transitivity constraints on coreference pairs. Instead of enforcing transitivity closure constraints, which brings O(n3) complexity, we employ a strategy to reduce the number of constraints without large performance d...

Efficiently incorporating entity-level information is a challenge for coreference resolution systems due to the difficulty of exact inference over partitions. We describe an end-to-end discriminative probabilistic model for coreference that, along with standard pairwise features, enforces structural agreement constraints between specified properties of coreferent mentions. This model can be rep...

We introduce strong separation axioms in bitopological spaces. We also introduce the notion of strong pairwise compactness.

This paper presents a new asymptotically exact lower bound on pairwise error probability of a space-time code as well as an example code that outperforms the comparable orthogonal-design-based space-time (ODST) code. Also contained in the paper are some observations relating to exact pairwise error probability, signal design guidelines and simplicity of the ODST code receiver. Keywords— Space-t...

Most existing representative works in semi-supervised clustering do not sufficiently solve the violation problem of pairwise constraints. On the other hand, traditional kernel methods for semi-supervised clustering not only face the problem of manually tuning the kernel parameters due to the fact that no sufficient supervision is provided, but also lack a measure that achieves better effectiven...

Recent advances in clustering consider incorporating background knowledge in the partitioning algorithm, using, e.g., pairwise constraints between objects. As a matter of fact, prior information, when available, often makes it possible to better retrieve meaningful clusters in data. Here, this approach is investigated in the framework of belief functions, which allows us to handle the imprecisi...