Results 1  10
of
10,403
Muscle: multiple sequence alignment with high accuracy and high throughput
 NUCLEIC ACIDS RES
, 2004
"... We describe MUSCLE, a new computer program for creating multiple alignments of protein sequences. Elements of the algorithm include fast distance estimation using kmer counting, progressive alignment using a new profile function we call the logexpectation score, and refinement using treedependent r ..."
Abstract

Cited by 2509 (7 self)
 Add to MetaCart
dependent restricted partitioning. The speed and accuracy of MUSCLE are compared with TCoffee, MAFFT and CLUSTALW on four test sets of reference alignments: BAliBASE, SABmark, SMART and a new benchmark, PREFAB. MUSCLE achieves the highest, or joint highest, rank in accuracy on each of these sets. Without refinement
HighRank Matrix Completion
"... This paper considers the problem of completing a matrix with many missing entries under the assumption that the columns of the matrix belong to a union of multiple lowrank subspaces. This generalizes the standard lowrank matrix completion problem to situations in which the matrix rank can be quite ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
be quite high or even full rank. Since the columns belong to a union of subspaces, this problem may also be viewed as a missingdata version of the subspace clustering problem. Let X be an n×N matrix whose (complete) columns lie in a union of at most k subspaces, each of rank ≤ r < n, and assume N ≫ kn
Elliptic Curves of High Rank
, 2012
"... The study of elliptic curves grows out of the study of elliptic functions which dates back to work done by mathematicians such as Weierstrass, Abel, and Jacobi. Elliptic curves continue to play a prominent role in mathematics today. An elliptic curve E is defined by the equation, y2 = x3 + ax + b, w ..."
Abstract
 Add to MetaCart
of all points of finite order. The rank r is difficult to compute and the main goal of this research is to explore the relationship between ranks of elliptic curves and values of a and b. Specifically, we have put a lower bound on the ranks of equations of the form Cm: y 2 = x3 −m2x + 1 and Km: y
Spacetime codes for high data rate wireless communication: Performance criterion and code construction
 IEEE TRANS. INFORM. THEORY
, 1998
"... We consider the design of channel codes for improving the data rate and/or the reliability of communications over fading channels using multiple transmit antennas. Data is encoded by a channel code and the encoded data is split into n streams that are simultaneously transmitted using n transmit ant ..."
Abstract

Cited by 1782 (28 self)
 Add to MetaCart
constructed from pairs of distinct code sequences. The minimum rank among these matrices quantifies the diversity gain, while the minimum determinant of these matrices quantifies the coding gain. The results are then extended to fast fading channels. The design criteria are used to design trellis codes
Exact Matrix Completion via Convex Optimization
, 2008
"... We consider a problem of considerable practical interest: the recovery of a data matrix from a sampling of its entries. Suppose that we observe m entries selected uniformly at random from a matrix M. Can we complete the matrix and recover the entries that we have not seen? We show that one can perfe ..."
Abstract

Cited by 873 (26 self)
 Add to MetaCart
perfectly recover most lowrank matrices from what appears to be an incomplete set of entries. We prove that if the number m of sampled entries obeys m ≥ C n 1.2 r log n for some positive numerical constant C, then with very high probability, most n × n matrices of rank r can be perfectly recovered
Cumulated Gainbased Evaluation of IR Techniques
 ACM Transactions on Information Systems
, 2002
"... Modem large retrieval environments tend to overwhelm their users by their large output. Since all documents are not of equal relevance to their users, highly relevant documents should be identified and ranked first for presentation to the users. In order to develop IR techniques to this direction, i ..."
Abstract

Cited by 694 (3 self)
 Add to MetaCart
Modem large retrieval environments tend to overwhelm their users by their large output. Since all documents are not of equal relevance to their users, highly relevant documents should be identified and ranked first for presentation to the users. In order to develop IR techniques to this direction
Optimizing Search Engines using Clickthrough Data
, 2002
"... This paper presents an approach to automatically optimizing the retrieval quality of search engines using clickthrough data. Intuitively, a good information retrieval system should present relevant documents high in the ranking, with less relevant documents following below. While previous approaches ..."
Abstract

Cited by 1314 (23 self)
 Add to MetaCart
This paper presents an approach to automatically optimizing the retrieval quality of search engines using clickthrough data. Intuitively, a good information retrieval system should present relevant documents high in the ranking, with less relevant documents following below. While previous
The use of MMR, diversitybased reranking for reordering documents and producing summaries
 In SIGIR
, 1998
"... jadeQcs.cmu.edu Abstract This paper presents a method for combining queryrelevance with informationnovelty in the context of text retrieval and summarization. The Maximal Marginal Relevance (MMR) criterion strives to reduce redundancy while maintaining query relevance in reranking retrieved docum ..."
Abstract

Cited by 768 (14 self)
 Add to MetaCart
jadeQcs.cmu.edu Abstract This paper presents a method for combining queryrelevance with informationnovelty in the context of text retrieval and summarization. The Maximal Marginal Relevance (MMR) criterion strives to reduce redundancy while maintaining query relevance in reranking retrieved
Learnability in Optimality Theory
, 1995
"... In this article we show how Optimality Theory yields a highly general Constraint Demotion principle for grammar learning. The resulting learning procedure specifically exploits the grammatical structure of Optimality Theory, independent of the content of substantive constraints defining any given gr ..."
Abstract

Cited by 529 (35 self)
 Add to MetaCart
In this article we show how Optimality Theory yields a highly general Constraint Demotion principle for grammar learning. The resulting learning procedure specifically exploits the grammatical structure of Optimality Theory, independent of the content of substantive constraints defining any given
Results 1  10
of
10,403