相关论文: When LP is the Cure for Your Matching Woes: Approx…

This paper has been withdrawn by the author(s), due to the existence of a much better paper in http://arxiv.org/abs/cs.CR/0207027

The graph matching problem is a significant special case of the Quadratic Assignment Problem, with extensive applications in pattern recognition, computer vision, protein alignments and related fields. As the problem is NP-hard, relaxation…

We propose a novel Linear Program (LP) based formula- tion for solving jigsaw puzzles. We formulate jigsaw solving as a set of successive global convex relaxations of the stan- dard NP-hard formulation, that can describe both jigsaws with…

This article is devoted to propose some lower and upper bounds for the coupled-tasks scheduling problem in presence of compatibility constraints according to classical complexity hypothesis ($\mathcal{P} \neq \mathcal{NP}$,…

This paper is withdrawn because the results in the paper are included in a paper to be published in Mathematical and Computer Modelling.

It is common to reject undesired outputs of Large Language Models (LLMs); however, current methods to do so require an excessive amount of computation to re-sample after a rejection, or distort the distribution of outputs by constraining…

In this paper, we attempt to solve the problem of Prepositional Phrase (PP) attachments in English. The motivation for the work comes from NLP applications like Machine Translation, for which, getting the correct attachment of prepositions…

This paper has been withdrawn by arXiv administrators because of disputed claims of authorship among former collaborators

We propose an efficient algorithm for approximate computation of the profile maximum likelihood (PML), a variant of maximum likelihood maximizing the probability of observing a sufficient statistic rather than the empirical sample. The PML…

There has recently been considerable interest in the use of lexically-based statistical techniques to resolve prepositional phrase attachments. To our knowledge, however, these investigations have only considered the problem of attaching…

This submission has been withdrawn by arXiv admins due to fraudulent affiliation claims by the original submitter.

This paper has been withdrawn by the authors. Significantly revised versions of the results of this paper are now available in arXiv:0707.0487v2 and arXiv:0808.3169v1.

The initial remarks in this technical report are primarily for those not familiar with the properties of L1 approximation, but the remainder of the report should also interest readers who are already acquainted with the inner workings of L1…

This version has been withdrawn. The new and final version is on ArXiv 1103.4878

The results in the recently posted manuscript arXiv:math/0405153v3 are incorrect. The correct version of the aimed results is not original. The preprint contains material from references that are not properly quoted.

This is the original version of my Ph.D. thesis. The main results have been divided up between papers arXiv:2111.09784 and arXiv:2204.10924. This paper has been kept on the arXiv to preserve some proofs of elementary lemmas that will be…

This paper has been withdrawn by the author because overcame by arXiv:0910.4694

This paper has been withdrawn. With the advancement of statistical theory and computing power, data sets are providing a greater amount of insight into the problems of today. Statisticians have an ever increasing number of tools to attack…

In this paper we present a collection of results pertaining to haplotyping. The first set of results concerns the combinatorial problem of reconstructing haplotypes from incomplete and/or imperfectly sequenced haplotype data. More…

This paper has been withdrawn by the author; a revised version is part of the author's phd-thesis "Quasi-logarithmic structures" (Zurich, 2007).