Archives and Documentation Center
Digital Archives

Browsing M.S. Theses by Author "Say, Ahmet Celal Cem."

Browsing M.S. Theses by Author "Say, Ahmet Celal Cem."

Sort by: Order: Results:

  • A linguistically motivated information retrieval system for Turkish 
    Pembe, Fatma Canan. (Thesis (M.S.)-Bogazici University. Institute for Graduate Studies in Science and Engineering, 2004., 2004.)
    Information retrieval (IR) has become an important application in today's computer world because of the great increase in the amount of web-based documents and the widespread use of the Internet. However, the classical ...
  • Blind spots of qualitative simulators 
    Taşdemir, Nuri. (Thesis (M.S.)-Bogazici University. Institute for Graduate Studies in Science and Engineering, 2007., 2007.)
    Qualitative simulators are important tools for analyzing the possible behaviors of a dynamical system. The technique of qualitative simulation has some theoretical limitations. For some input system models, a qualitative ...
  • Computability-theoretic limitations of qualitative simulation 
    Yılmaz, Özgür. (Thesis (M.S.)-Bogazici University. Institute for Graduate Studies in Science and Engineering, 2005., 2005.)
    Qualitative reasoning and simulation are useful mathematical tools, especially for theanalysis, design and diagnosis of dynamic systems. Simulators which are seen to beincomplete, that is, which produce spurious predictions ...
  • Computation with chained Closed Timelike Curves 
    Çıkla, Mert Can. (Thesis (M.S.) - Bogazici University. Institute for Graduate Studies in Science and Engineering, 2019., 2019.)
    Discussions of Closed Timelike Curves (CTC) led to a few computation models that when used in conjunction with a Turing Machine, yield much more efficient com putations. CTC assisted computation has the ability to send a ...
  • Constant-space, constant-randomness verifiers with arbitrarily small strong error 
    Gezer, Mehmet Utkan. (Thesis (M.S.) - Bogazici University. Institute for Graduate Studies in Science and Engineering, 2020., 2020.)
    We study the capabilities of probabilistic finite-state machines that act as verifiers for certificates of language membership for input strings, in the regime where the verifiers are restricted to toss some fixed nonzero ...
  • Design and simulation of two-way quantum finite automata 
    Atak, Fatih Mehmet. (Thesis (M.S.)-Bogazici University. Institute for Graduate Studies in Science and Engineering, 2006., 2006.)
    In this thesis, we review classical finite state automata, (FSAs and TWAs) and 2- way quantum finite state automata (2QFAs). We examine fundamental theorems and their proofs. We develop a software simulator of quantum ...
  • Efficient two-way quantum finite state automata 
    Yakaryılmaz, Abuzer. (Thesis (M.S.)-Bogazici University. Institute for Graduate Studies in Science and Engineering, 2007., 2007.)
    The discovery of quantum algorithms which are exponentially more e fficient than the best known classical algorithms for similar tasks has spurred researchers to compare the relative powers of the classical and quantum ...
  • Generalizations of hidden subgroup algorithms 
    Poslu, Damla. (Thesis (M.S)-Bogazici University.Institute for Graduate Studies in Science and Engineering, 2005., 2005.)
    In the future, it can be possible to store bit information in atoms. In thatcase, classical mechanics will not be enough to explain the atomic level model. Instead quantum mechanics will have to be used. A quantum bit ...
  • Optimization of quantum random walk simulations 
    Küçük, Uğur. (Thesis (M.S)-Bogazici University.Institute for Graduate Studies in Science and Engineering, 2005., 2005.)
    In computer science, an exponential performance gain is considered an importantachievement that can extend the set of practically computable problems. Behind the interest in quantum computation, there is the fact that ...
  • Problems of adiabatic quantum program design 
    Khusnitdinova, Evgeniya. (Thesis (M.S.)-Bogazici University. Institute for Graduate Studies in Science and Engineering, 2006., 2006.)
    Although several quantum programming languages have already been proposed, none of these are based on the newly discovered adiabatic evolution approach. We acknowledge the main problem in adiabatic quantum computation to ...
  • Real-time vector automata 
    Salehi, Özlem. (Thesis (M.S.) - Bogazici University. Institute for Graduate Studies in Science and Engineering, 2013., 2013.)
    Finite automaton has been one of the most studied models in automata theory. The limited power of the standard model has led researchers to make various extensions to the standard model. Counter automaton, automaton with ...
  • Succinctness analysis of finite automaton models 
    Erdoğan, Emre. (Thesis (M.S.) - Bogazici University. Institute for Graduate Studies in Science and Engineering, 2017., 2017.)
    Finite state automaton, or finite automaton, is a mathematical model of compu tation and has been one of the most studied models in automata theory. Throughout the years, many different types of finite state automata are ...
  • The complexity of debate checking 
    Demirci, Hüseyin Gökalp. (Thesis (M.S.) - Bogazici University. Institute for Graduate Studies in Science and Engineering, 2013., 2013.)
    We introduce a model of probabilistic debate checking, where a silent resourcebounded veri er reads a dialogue about the membership of a given string in the language under consideration between a prover and a refuter. Our ...
  • The query complexity of estimating entropy 
    Jafarov, Jafar. (Thesis (M.S.) - Bogazici University. Institute for Graduate Studies in Science and Engineering, 2016., 2016.)
    We investigate the query complexity of additively estimating entropy of a discrete probability distribution in two settings. Let p be an unknown probability distribution on [n] := f1; 2; : : : ng, and de ne two kinds of ...
  • Using polynomial approximations to discover qualitative models 
    Gerçeker, Reha Kamil. (Thesis (M.S.)-Bogazici University. Institute for Graduate Studies in Science and Engineering, 2006., 2006.)
    The set of ordinary differential equations (ODE) of a physical system determines the precise numerical behavior that will be exhibited in the future. Abstracting an ODE into a qualitative differential equation (QDE) system ...

Search Digital Archive


Browse

My Account