In this work we will present algorithms for decoding rank metric codes. First we will look at a new decoding algorithm for Gabidulin codes using the property of Dickson matrices corresponding to linearized polynomials. We will be using a Berlekamp-Massey-like algorithm in the process. We will show the difference between our and existing algorithms. Apart from being a new algorithm, it is also i...

Many applications in information retrieval, natural language processing, data mining, and related fields require a ranking of instances with respect to a specified criteria as opposed to a classification. Furthermore, for many such problems, multiple established ranking models have been well studied and it is desirable to combine their results into a joint ranking, a formalism denoted as rank a...

Domain keywords extraction is very important for information extraction, information retrieval, classification, clustering, topic detection and tracking, and so on. TextRank is a common graph-based algorithm for keywords extraction. For TextRank, only edge weights are taken into account. We proposed a new text ranking formula that takes into account both edge and node weights, named F2N-Rank. E...

The minimum rank problem asks to find the minimum rank over all matrices with given pattern associated with a graph. This problem is NP-hard, and there is no known approximation method. In this article, a numerical algorithm is given to heuristically approximate the minimum rank using alternating projections. The effectiveness of this algorithm is demonstrated by comparing its results to a rela...

velocity analysis is one of the most important step in seismic data processing. it affects not only many processing steps directly and indirectly, but also is known as a primary interpretation of the data. however, it can also be assumed as one of the most time consuming processing step. the conventional velocity analysis method measures the energy amplitude along hyperbolic trajectories within...

We consider the problem of commutative rank computation of a given matrix space, B ⊆ Fn×n. The problem is fundamental, as it generalizes several computational problems from algebra and combinatorics. For instance, checking if the commutative rank of the space is n, subsumes problems such as testing perfect matching in graphs and identity testing of algebraic branching programs. An efficient det...

We present the results of applying a learning to rank algorithm to the 2011 TREC Legal dataset. The learning to rank algorithm we use was designed to maximize NDCG, MAP, and AUC scores. We therefore examine our results using the AUC and hypothetical F1 scores. We find query expansion and learning to rank improve scores beyond standard language model retrieval, however learning to rank does not ...

Twitter, as one of the most popular micro-blogging services, provides large quantities of fresh information including real-time news, comments, conversation, pointless babble and advertisements. Twitter presents tweets in chronological order. Recently, Twitter introduced a new ranking strategy that considers popularity of tweets in terms of number of retweets. This ranking method, however, has ...

An efficient algorithm for the direct solution of a linear system associated with the discretization of boundary integral equations with oscillatory kernels (in two dimensions) is described without having to compute the complete matrix of the linear system. This algorithm is based on the unitary-weight representation, for which a new construction based on adaptive cross approximation is propose...