Methods that measure compatibility between mention pairs are currently the dominant approach to coreference. However, they suffer from a number of drawbacks including difficulties scaling to large numbers of mentions and limited representational power. As the severity of these drawbacks continue to progress with the growing demand for more data, the need to replace the pairwise approaches with ...

Learning to hash has become a crucial technique for big data analytics. Among existing methods, supervised learning approaches play an important role as they can produce compact codes and enable semantic search. However, the size of an instancepairwise similarity matrix used in most supervised hashing methods is quadratic to the size of labeled training data, which is very expensive in terms of...

The subsets A, B of the n-element X are said to be s-strongly separating if the two sets divide X into 4 sets of size at least s. The maximum number h(n, s) of pairwise s-strongly separating subsets was asymptotically determined by Frankl [8] for fixed s and large n. A new proof is given. Also, estimates for h(n, cn) are found where c is a small constant.

We formulate a stability notion for two?sided pairwise matching problems with individually insignificant agents in distributional form. Matchings are formulated as joint distributions over the characteristics of populations to be matched. Spaces can high?dimensional and need not compact. Stable matchings exist without transfers, stable correspond precisely limits finite?agent models. embed exis...

In this paper, we study the Cauchy–Dirichlet problem for parabolic complex Monge–Ampère equations on strongly pseudoconvex domains using viscosity method. We prove a comparison principle and use it to existence uniqueness of solution in certain cases where sets $$\{z\in \Omega : f(t, z)=0 \}$$ may be pairwise disjoint.

Given a topological groupG (usually compact abelian), the authors study the poset D = D(G) of dense subgroups of G and its impact on the algebraic structure of G. A key tool for this is the subgroup den(G) := ∩ D. Definition. For a cardinal κ ≥ 1, a topological group is in the class Ff (κ) [F(κ); F2(κ); Fad(κ), respectively] if some family of κ-many dense subgroups of G is independent and freel...

Recently, sparse coding has been receiving much attention in object and scene recognition tasks because of its superiority in learning an effective codebook over k-means clustering. However, empirically, such codebook requires a relatively large number of visual words, essentially bases, to achieve high recognition accuracy. Therefore, due to the combinatorial explosion of visual words, it is i...

We study structures which have arisen in recent work by the present author and Bob Coecke on a categorical axiomatics for Quantum Mechanics; in particular, the notion of strongly compact closed category. We explain how these structures support a notion of scalar which allows quantitative aspects of physical theory to be expressed, and how the notion of strong compact closure emerges as a signif...

In stereophonic acoustic echo cancellation (SAEC) problem, fast and accurate tracking of echo path is strongly required for stable echo cancellation. In this paper, we propose a class of efficient fast SAEC schemes with linear computational complexity (with respect to filter length). The proposed schemes are based on pairwise optimal weight realization (POWER) technique, thus realizing a “best”...