Hasil Pencarian  ::  Simpan CSV :: Kembali

"Penggabungan dua himunan terutut (merging) merupakan salah satu bahan pembahasan dalam bidang ilmu komputer, khususnya yang berkenaan dengan analisa dan kompleksitas algoritma serta kecepatan komputasi. Salah satu usaha untuk nenigkatkan kecepatan komputasi masalah penggabungan ialah dengan menggunakan proses paralel. Oleh karena itu penulis membahas algoritma paralel Penggabungan dari dua buah himpunan terurut pada model komputasi paralel SM CREW (Shared-Memory concurrent Read, Exclusive Write) dari kelas komputer SIMD (Single Instruction Stream Multiple Data Stream) dan SM EREW (Shared-Memory Exlusive Read, Exclusive Write) dari kelas Computer SIMD (Single Instruction Stream Multiple Data Stream), serta analisa algloritma-algoritma tersebut. Untuk implementasinya dipakai metoda simulasi dengan bahasa pemrogaman ADA, karena bahasa pemrogaman ini mendukung dalam simulasi pemrosesan seeara paralel. Dengan membuat simulasi ini dapat diperoleh hasil yang bisa dipakai untuk memperkirakan kemungkinan jika diimplementasikan pada kondisi yang sesungguhnya."

"Teknik kompresi citra merupakan jawaban atas kebutuhan ruang memori yang cukup besar dalam penyimpanan data citra digital. Citra fraktal merupakan citra yang bersifat self-similarity. Hal ini berarti citra fraktal tersebut tersusun atas bagian-bagian yang tampak sama dengan citra awal sendiri. Skripsi ini bertujuan melakukan kompresi citra dengan metode fraktal tersebut. Prinsip kompresi citra metode fraktal ialah melakukan pencarian domain block yang paling mirip dengan range block pada citra lalu dilakukan transformasi afinitas terhadap domain block tadi. Partisi quadtree diterapkan dalam kompresi citra metode fraktal untuk menggeneralisasikan ukuran range block secara tetap yaitu 2n×2n, sedangkan penerapan Huffman code bertujuan agar menghasilkan citra dengan kualitas yang baik.

---

Image compression is an answer of the need of large memory space in saving digital image data. Fractal image is a self-similarity image. This means fractal is composed of images similar to the original one. This mini thesis discussed about fractal image compression. The main idea of the fractal image compression is to search the most similar domain block to range block then use the affine transform to the domain block. A quadtree partition is applied to generalize the size of range block, 2n×2n, while the Huffman code is applied to get good image quality."

"This book constitutes the refereed proceedings of the 23rd Annual Symposium on Combinatorial Pattern Matching, CPM 2012, held in Helsinki, Finland, in July 2012. The 33 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 60 submissions. The papers address issues of searching and matching strings and more complicated patterns such as trees, regular expressions, graphs, point sets, and arrays. The goal is to derive non-trivial combinatorial properties of such structures and to exploit these properties in order to either achieve superior performance for the corresponding computational problems or pinpoint conditions under which searches cannot be performed efficiently. The meeting also deals with problems in computational biology, data compression and data mining, coding, information retrieval, natural language processing, and pattern recognition"

"This book constitutes the refereed proceedings of the 9th International Workshop on Algorithms and Models for the Web-Graph, WAW 2012, held in Halifax, Nova Scotia, Canada, in June 2012. The 13 papers presented were carefully reviewed and selected for inclusion in this volume. They address a number of topics related to the complex networks such hypergraph coloring games and voter models, algorithms for detecting nodes with large degrees, random Appolonian networks, and a sublinear algorithm for Pagerank computations."

"This is the first book dedicated to this topic, in the areas of constraint programming, machine learning, evolutionary computing, and feedback control theory. After the editors' introduction to autonomous search, the chapters are focused on tuning algorithm parameters, autonomous complete (tree-based) constraint solvers, autonomous control in metaheuristics and heuristics, and future autonomous solving paradigms."

"This volume constitutes the refereed proceedings of the 37th International Symposium on Mathematical Foundations of Computer Science, MFCS 2012, held in Bratislava, Slovakia, in August 2012. The 63 revised full papers presented together with 8 invited talks were carefully reviewed and selected from 162 submissions. Topics covered include algorithmic game theory, algorithmic learning theory, algorithms and data structures, automata, formal languages, bioinformatics, complexity, computational geometry, computer-assisted reasoning, concurrency theory, databases and knowledge-based systems, foundations of computing, logic in computer science, models of computation, semantics and verification of programs, and theoretical issues in artificial intelligence."

"The papers in this volume were presented at the Ninteenth Annual ACM-SIAM Symposium on Discrete Algorithms, held January 20-22, 2008, in San Francisco, California. The Symposium was jointly sponsored by the SIAM Activity Group on Discrete Mathematics and by SIGACT, the ACM Special Interest Group on Algorithms and Computation Theory."