We study the parameterized complexity of the problems of determining whether a graph contains a k-edge subgraph (k-vertex induced subgraph) that is a -graph for -graphs being one ...
This article considers sparse signal recovery in the presence of noise. A mutual incoherence condition which was previously used for exact recovery in the noiseless case is shown t...
Abstract. In [9], we introduced and analyzed a recovery-based a posteriori error estimator for conforming linear finite element approximation to interface problems. It was shown th...
Commonly used coreference resolution evaluation metrics can only be applied to key mentions, i.e. already annotated mentions. We here propose two variants of the B3 and CEAF coref...
This paper analyzes the entrants to the 2007 TAC Market Design Game. We present a classification of the entries to the competition, and use this classification to compare these ent...
Jinzhong Niu, Kai Cai, Simon Parsons, Peter McBurn...