Xem 1-20 trên 115 kết quả Efficient algorithms
  • In this paper, we present two vector-level software algorithms which essentially eliminate such bit-wise operations for Gaussian normal bases. Our analysis and timing results show that the software implementation of the proposed algorithm is faster than previously reported normal basis multiplication algorithms.

    pdf14p dunglh2013 02-04-2014 13 1   Download

  • The best selling 'Algorithmics' presents the most important, concepts, methods and results that are fundamental to the science of computing. It starts by introducing the basic ideas of algorithms, including their structures and methods of data manipulation. It then goes on to demonstrate how to design accurate and efficient algorithms, and discusses their inherent limitations.

    pdf533p trac2_123 16-04-2013 30 7   Download

  • Tuyển tập các báo cáo nghiên cứu về sinh học được đăng trên tạp chí y học Molecular Biology cung cấp cho các bạn kiến thức về ngành sinh học đề tài: Efficient algorithms for training the parameters of hidden Markov models using stochastic expectation maximization (EM) training and Viterbi training...

    pdf16p hoami_2511 21-10-2011 25 3   Download

  • Tuyển tập các báo cáo nghiên cứu về sinh học được đăng trên tạp chí y học Molecular Biology cung cấp cho các bạn kiến thức về ngành sinh học đề tài: Efficient algorithms for the discovery of gapped factors...

    pdf10p hoami_2511 21-10-2011 19 3   Download

  • Tuyển tập các báo cáo nghiên cứu về sinh học được đăng trên tạp chí y học Molecular Biology cung cấp cho các bạn kiến thức về ngành sinh học đề tài: Efficient algorithms for analyzing segmental duplications with deletions and inversions in genomes...

    pdf12p hoami_2511 21-10-2011 26 2   Download

  • Tuyển tập các báo cáo nghiên cứu về sinh học được đăng trên tạp chí sinh học quốc tế đề tài: An efficient algorithm to compute marginal posterior genotype probabilities for every member of a pedigree with loops

    pdf11p toshiba18 08-11-2011 25 2   Download

  • We discuss algorithms for generation within the Lambek Theorem Proving Framework. Efficient algorithms for generation in this framework take a semantics-driven strategy. This strategy can be modeled by means of rules in the calculus that are geared to generation, or by means of an algorithm for the Theorem Prover. The latter possibility enables processing of a bidirectional calculus. Therefore Lambek Theorem Proving is a natural candidate for a 'uniform' architecture for natural language parsing and generation.

    pdf7p bungio_1 03-05-2013 22 1   Download

  • This paper presents a hardware implementation of efficient algorithms that uses the mathematical framework. The framework based on the Winograd’s Fourier Transform Algorithm, obtaining a set of formulations that simplify cyclic convolution (CC) computations and CRT.

    pdf7p dunglh2013 02-04-2014 16 0   Download

  • Algorithms play the central role both in the science and practice of computing. Recognition of this fact has led to the appearance of a considerable number of textbooks on the subject. By and large, they follow one of two alternatives in presenting algorithms. One classifies algorithms according to a problem type. Such a book would have separate chapters on algorithms for sorting, searching, graphs, and so on. The advantage of this approach is that it allows an immediate comparison of, say, the efficiency of different algorithms for the same problem.

    pdf593p fangfangfang 11-05-2012 77 23   Download

  • A comprehensive treatment focusing on the creation of efficient data structures and algorithms, this text explains how to select or design the data structure best suited to specific problems. It uses C++ as the programming language and is suitable for second-year data structure courses and computer science courses in algorithmic analysis.

    pdf613p goshop_123 24-04-2013 63 19   Download

  • Data Structures and Algorithm Analysis Edition 3.2 (Java Version) a comprehensive treatment focusing on the creation of efficient data structures and algorithms, this text explains how to select or design the data structure best suited to specific problems. It uses Java as the programming language and is suitable for second-year data structure courses and computer science courses in algorithmic analysis.

    pdf601p thang2807 15-10-2014 47 7   Download

  • The field of information and communication technologies continues to evolve and grow in both the research and the practical domains. However, energy efficiency is an aspect in communication technologies that until recently was only considered for embedded, mobile or handheld battery constraint devices.

    pdf150p bi_bi1 08-07-2012 25 6   Download

  • The book presents a collection of chapters dealing with a wide selection of topics concerning different applications of modeling. It includes modeling, simulation and optimization applications in the areas of medical care systems, genetics, business, ethics and linguistics, applying very sophisticated methods. Algorithms, 3-D modeling, virtual reality, multi objective optimization, finite element methods, multi agent model simulation, system dynamics simulation, hierarchical Petri Net model and two level formalism modeling are tools and methods employed in these papers....

    pdf320p kimngan_1 05-11-2012 28 6   Download

  • In recent years, the credit derivatives market has become extremely active. Especially credit default swaps (CDSs) and collateralized debt obligations (CDOs) have contributed to what has been an amazing development. The most important benefit of credit derivatives is their ability to transfer the credit risk of an arbitrary number of obligors in a simple, efficient, and standardized way, giving rise to a liquid market for credit risk that can be easily accessed by many market participants.

    pdf0p baobinh1311 25-09-2012 18 5   Download

  • • Algorithm efficiency is considered with only big problem sizes. • We are not concerned with an exact measurement of an algorithm's efficiency. • Terms that do not substantially change the function’s magnitude are eliminated.

    pdf49p trinh02 28-01-2013 16 5   Download

  • Question 1. Reorder the following efficiencies from the smallest to the largest: a. 2n3 + n5 b. 2000 c. 4n+1 d. n4 e. (n-1)! f. nlog2(n) g. 2klogk(n) (k is a predefined constant) Solution: Efficiency: a measure of amount of time for an algorithm to execute (Time Efficiency) or a measure of amount of memory needed for an algorithm to execute (Space Efficiency).

    pdf32p loc_x_m 28-02-2013 34 4   Download

  • Several recent stochastic parsers use bilexical grammars, where each word type idiosyncratically prefers particular complements with particular head words. We present O(n 4) parsing algorithms for two bilexical formalisms, improving the prior upper bounds of O(n5). For a common special case that was known to allow O(n 3) parsing (Eisner, 1997), we present an O(n 3) algorithm with an improved grammar constant.

    pdf8p bunrieu_1 18-04-2013 14 3   Download

  • We investigate the problem of determining a compact underspecified semantical representation for sentences that may be highly ambiguous. Due to combinatorial explosion, the naive method of building semantics for the different syntactic readings independently is prohibitive. We present a method that takes as input a syntactic parse forest with associated constraintbased semantic construction rules and directly builds a packed semantic structure. The algorithm is fully implemented and runs in O(n4log(n)) in sentence length, if the grammar meets some reasonable 'normality' restrictions. ...

    pdf8p bunthai_1 06-05-2013 19 3   Download

  • The purpose of this paper is to examine the oft-repeated assertion regarding the efficiency of a "simple parsing algorithm" combinable with a variety of different grammars written in the form of appropriate tables of rules.

    pdf0p nghetay_1 06-04-2013 12 2   Download

  • In this paper we compare two grammar-based generation algorithms: the Semantic-Head-Driven Generation Algorithm (SHDGA), and the Essential Arguments Algorithm (EAA). Both algorithms have successfully addressed several outstanding problems in grammarbased generation, including dealing with non-monotonic compositionality of representation, left-recursion, deadlock-prone rules, and nondeterminism. We concentrate here on the comparison of selected properties: generality, efficiency, and determinism.

    pdf8p bunmoc_1 20-04-2013 7 2   Download

Đồng bộ tài khoản