Browsing Bilkent Theses by Title
Now showing items 36973716 of 5492

Parallel direct volume rendering of unstructured grids based on objectspace decomposition
(Bilkent University, 1997) 
Parallel hardware and software implementations for electromagnetic computations
(Bilkent University, 2005)Multilevel fast multipole algorithm (MLFMA) is an accurate frequencydomain electromagnetics solver that reduces the computational complexity and memory requirement significantly. Despite the advantages of the MLFMA, ... 
Parallel image restoration
(Bilkent University, 2004)In this thesis, we are concerned with the image restoration problem which has been formulated in the literature as a system of linear inequalities. With this formulation, the resulting constraint matrix is an unstructured ... 
Parallel machine scheduling subject to machine availability constraints
(Bilkent University, 2006)Within a planning horizon, machines may become unavailable due to unexpected breakdowns or prescheduled activities. A realistic approach in constructing the production schedule should explicitly take into account such ... 
Parallel mapping and circuit partitioning heuristics based on mean field annealing
(Bilkent University, 1992)Moan Field Annealinp; (MFA) aJgoritlim, receñí,ly proposc'd for solving com binatorial optimization problems, combines the characteristics of nenral networks and simulated annealing. In this thesis, MFA is formulated for ... 
Parallel maze routing algorithms on a hypercube multicomputer
(Bilkent University, 1991) 
Parallel processing for progressive refinement radiosity
(Bilkent University, 1993)Progressive refinement radiosity is an increasingly popular method for realistic image synthesis of nonexisting environments. The method successfully approximates the light distribution in an environment, however it ... 
A Parallel Prolog emulator
(Bilkent University, 1988)There are various parallel Prolog execution models proposed so far. In this study, an emulator has been developed to test the execution model PPEM. The emulator is used to collect data to evaluate the performance of the ... 
Parallel rendering algorithms for distributedmemory multicomputers
(Bilkent University, 1997) 
Parallel sequence mining on distributed memory systems
(Bilkent University, 2001)Discovering all the frequent sequences in very large databases is a time consuming task. However, large databases forces to partition the original database into chunks of data to process in mainmemory. Most current ... 
Parallel sparse matrix vector multiplication techniques for shared memory architectures
(Bilkent University, 2014)SpMxV (Sparse matrix vector multiplication) is a kernel operation in linear solvers in which a sparse matrix is multiplied with a dense vector repeatedly. Due to random memory access patterns exhibited by SpMxV operation, ... 
Parallel sparse matrixvector multiplies and iterative solvers
(Bilkent University, 2005)Sparse matrixvector multiply (SpMxV) operations are in the kernel of many scientific computing applications. Therefore, efficient parallelization of SpMxV operations is of prime importance to scientific computing ... 
Parallel streaming graph partitioning utilizing multilevel framework
(Bilkent University, 201808)Graph partitioning is widely used for e cient parallelization of a variety of applications. Streaming graph partitioning is a one pass partitioning solution provided to overcome high computation costs of o ine graph ... 
Parallel text retrieval on PC clusters
(Bilkent University, 2003)The inverted index partitioning problem is investigated for parallel text retrieval systems. The objective is to perform efficient query processing on an inverted index distributed across a PC cluster. Alternative ... 
Parallel text retrieval on temporally versioned document collections
(Bilkent University, 2008)In recent years, as the access to the Internet is getting easier and cheaper, the amount and the rate of change of the online data presented to the Internet users are increasing at an astonishing rate. This everchanging ... 
Parallelization of an interior point algorithm for linear programming
(Bilkent University, 1994)In this study, we present the parallelization of Mehrotra’s predictorcorrector interior point algorithm, which is a Karmarkartype optimization method for linear programming. Computation types needed by the algorithm ... 
Parallelization of hierarchical radiosity algorithms on distributed memory computers
(Bilkent University, 1998) 
Parallelization of the fast multipole solution of the electromagnetic scattering problem
(Bilkent University, 1997) 
Paralogspecific gene copy number discovery within segmental duplications
(Bilkent University, 201910)With the advancing technology in genome sequencing and analysis, it has become evident that the structural variations are the main source of alteration in human genome. Despite their signi cance in understanding disease ... 
Parameter estimation in switching stochastic models
(Bilkent University, 2004)In this thesis, we suggest an approach to statistical parameter estimation when an estimator is constructed by the trajectory observations of a stochastic system and apply the approach to reliability models. We analyze ...