Learn More
We study the problem of finding a maximum matching in a graph given by an input stream listing its edges in some arbitrary order, where the quantity to be maximized is given by a monotone submodular function on subsets of edges. This problem, which we call maximum submodular-function matching (MSM), is a natural generalization of maximum weight matching(More)
BACKGROUND Serine proteases promote inflammation and tissue remodeling by activating proteinase-activated receptors, urokinase, metalloproteinases and angiotensin. In the present study, 4-(2-Aminoethyl) benzenesulfonyl fluoride (AEBSF) a serine protease inhibitor was evaluated for prophylactic and therapeutic treatment in mouse model of airway allergy. (More)
We develop a paradigm for studying multi-player deterministic communication, based on a novel combinatorial concept that we call a strong fooling set. Our paradigm leads to optimal lower bounds on the per-player communication required for solving multi-player EQUALITY problems in a private-message setting. This in turn gives a very strong - O(1) versus(More)
Protease allergens are known to enhance allergic inflammation but their exact role in initiation of allergic reactions at mucosal surfaces still remains elusive. This study was aimed at deciphering the role of serine protease activity of Per a 10, a major cockroach allergen in initiation of allergic inflammation at mucosal surfaces. We demonstrate that Per(More)
We consider the maximum matching problem in the semi-streaming model formalized by Feigenbaum et al. [13] that is inspired by giant graphs of today. As our main result, we give a two-pass (1/2 + 1/16)-approximation algorithm for bipartite/triangle-free graphs and a two-pass (1/2 + 1/32)-approximation algorithm for general graphs; these improve the ratios of(More)
  • 1