Searching for domain-specific information on the web is tough. Community documents are therefore made searchable with a dedicated search platform. Search Methods employed document corpora often evaluated over aspect of efficiency and not focusing often-overlooked user experience. In paper, we present an evaluation methods methods. The represented in RDF as well free-text. We describe environmen...

Binary classification is the problem of predicting the class a given sample belongs to. To achieve a good prediction performance, it is important to find a suitable model for a given dataset. However, it is often time consuming and impractical for practitioners to try various classification models because each model employs a different formulation and algorithm. The difficulty can be mitigated ...

HEURISTIC SEARCH UNDER A DEADLINE by Austin Dionne University of New Hampshire, May, 2011 In many heuristic search problems of practical interest, insufficient time is available to find a provably optimal solution. The currently accepted methods of finding a best possible sub-optimal solution within a time deadline are the anytime methods which do not directly consider the time remaining in the...

Nowadays the information retrieval (from the Internet and off-line sources) is one of the major research areas in Computer Science. The main criteria of a successful search are the high relevance of search query information and fast response time. Traditional search engines typically use an approach «Bag of words» based on statistical methods to search for information. This approach takes prece...

The Barzilai-Borwein method for nonlinear optimization is adapted to Riemannian manifold optimization. More generally, global convergence of a nonmonotone line-search strategy for Riemannian optimization algorithms is proved under some standard assumptions. By a set of numerical tests, the Riemannian BarzilaiBorwein method with nonmonotone line-search is shown to be competitive in several Riema...

In this paper, a modified conjugate gradient method is presented for solving large-scale unconstrained optimization problems, which possesses the sufficient descent property with Strong Wolfe-Powell line search. A global convergence result was proved when the (SWP) line search was used under some conditions. Computational results for a set consisting of 138 unconstrained optimization test probl...

In this paper, a new spectral PRP conjugate gradient method is proposed, which can always generate sufficient descent direction without any line search. Under some standard conditions, global convergence of the proposed method is established when the standard Armijo or weak Wolfe line search is used. Moreover, we extend these results to the HS method. Numerical comparisons are reported with som...

We present an algorithm based on the closest point search (CPS) in lattices for decoding of space-time block codes (STBC). The modified CPS algorithm based on the Schnorr-Euchner variation of the Pohst method is used to perform the decoding of STBC. This method is shown to be substantially faster than other known sphere decoding methods. Also we exploit a fast method for decoding of orthogonal ...