Hasil Pencarian  ::  Simpan CSV :: Kembali

Abstrak :
Dalam tesis dibahas pencocokan hampiran untai (approximate string matching) dari dua untai berbeda. Dalam meninjau tingkat kedekatan hampiran dua untai atau tingkat kemiripan dua untai digunakan ukuran Jarak Levenshtein, Dalam penentuan jarak tersebut digunakan metode program dinamik. Diperoleh beberapa sifat-sifat yang berhubungan dengan susunan kedua untai yang dicocokkan. Pada akhir tesis diberikan juga program komputer sederhana dalam penentuan jarak Levenshtein.

---

In this thesis described approximate string matching problem between two different strings. To show the approximate level of both strings or the similarity level of both strings is used Levenshtein distance. To determine Levenshtein distance is used by dynamic programming method. Found Some characteristics that have relation with composition of both strings that are matched. At the end of the thesis, given the simple computer program to determine Levenshtein distance.

Abstrak :
Dibahas visualisasi kurva hampiran dengan menggunakan metode Hampiran B-Spline. Dalam hampiran ini diberikan sejumlah data koordinat, dengan menggunakan kombinasi linear dari sejumlah basis B-Spline akan diperoleh kurva hampiran yang dimaksud. Fungsi basis yang digunakan disini berderajat 1,2, dan 3. Kurva yang dihasilkan kemudian akan divisualisasikan pada jendela gratis. Jendela grafis dibuat pada aplikasi yang dijalankan dengan sistem Microsoft Windows 16 bit dan 32 bit. Platform yang dipakai untuk membuat aplikasi adalah Borland C++ ver. 4.5 for Windows, pembuatan kelas baru yang merupakan turunan dari objek-objek yang telah ada pada platform ini sangat menunjang pada aplikasi yang dibentuk. Dengan sub selang penggambaran h diberikan oleh pengguna, maka semakin kecil h kurva hampiran yang dibentuk akan semakin halus. Semakin tinggi derajat fungsi basis yang digunakan maka kurva yang dihasilkan akan semakin halus, akan tetapi jumlah operasi rekursif yang dilakukan semakin banyak.

Abstrak :
ABSTRAK
Tugas akhir ini membahas tentang Algoritma pembesaran (augmeritasi) pada graph Campuran, yaitu penambahan ruas secara optimal pada graph Campuran sehingga diperoleh graph yang setiap ruasnya berada dalam sirkuit sederhana yang Traversabel atau graph terhubung kuat. Untuk rnendapatkan penambahan ruas yang optimal, graph Campuran disederhanakan kedalam bentuk graph Asiklik Campuran.

Abstrak :
This book follows the “semidefinite side” of these developments, presenting some of the main ideas behind approximation algorithms based on semidefinite programming. It develops the basic theory of semidefinite programming, presents one of the known efficient algorithms in detail, and describes the principles of some others. It also includes applications, focusing on approximation algorithms.

Abstrak :
Unlike other books on theoretical computer science, this textbook organizes approximation algorithms into chapters based on the design techniques for the algorithms. based on the design techniques for the algorithms. It helps the reader to better understand the design and analysis techniques for approximation algorithms.

Abstrak :
This book constitutes the thoroughly refereed post-proceedings of the 9th International Workshop on Approximation and Online Algorithms, WAOA 2011, held in Saarbrücken, Germany, in September 2011. The 21 papers presented were carefully reviewed and selected from 48 submissions. The volume also contains an extended abstract of the invited talk of Prof. Klaus Jansen. The Workshop on Approximation and Online Algorithms focuses on the design and analysis of algorithms for online and computationally hard problems. Both kinds of problems have a large number of applications in a wide variety of fields. Topics of interest for WAOA 2011 were: algorithmic game theory, approximation classes, coloring and partitioning, competitive analysis, computational finance, cuts and connectivity, geometric problems, inapproximability results, mechanism design, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, parameterized complexity, randomization techniques and scheduling problems.

Abstrak :
Data approximation by low-complexity models details the theory, algorithms, and applications of structured low-rank approximation. Efficient local optimization methods and effective suboptimal convex relaxations for Toeplitz, Hankel, and Sylvester structured problems are presented. Much of the text is devoted to describing the applications of the theory including, system and control theory, signal processing, computer algebra for approximate factorization and common divisor computation, computer vision for image deblurring and segmentation, machine learning for information retrieval and clustering, bioinformatics for microarray data analysis, chemometrics for multivariate calibration, and psychometrics for factor analysis.

Abstrak :
In this brief the authors discuss some important subclasses of polynomial optimization models arising from various applications, with a focus on approximations algorithms with guaranteed worst case performance analysis. The brief presents a clear view of the basic ideas underlying the design of such algorithms and the benefits are highlighted by illustrative examples showing the possible applications.