Now showing items 1-14 of 14

    • Coding of fingerprint images using binary subband decomposition and vector quantization 

      Gerek Ö.N.; Çetin, A.E. (1998)
      In this paper, compression of binary digital fingerprint images is considered. High compression ratios for fingerprint images is essential for handling huge amount of images in databases. In our method, the fingerprint ...
    • Computational methods for CTMCs 

      Dayar, Tuğrul; Stewart, W. J. (John Wiley & Sons, 2011)
      This article concerns the computation of stationary and transient distributions of continuous‐time Markov chains (CTMCs). Once the problem has been formulated, it is shown how computational methods for computing stationary ...
    • A decomposition approach for undiscounted two-person zero-sum stochastic games 

      Avşar, Z. M.; Baykal-Gürsoy, M. (Springer-Verlag Berlin Heidelberg, 1999)
      Two-person zero-sum stochastic games are considered under the long-run average expected payoff criterion. State and action spaces are assumed finite. By making use of the concept of maximal communicating classes, the ...
    • Decompositional analysis of Kronecker structured Markov chains 

      Bao, Y.; Bozkur, I. N.; Dayar, T.; Sun, X.; Trivedi, K. S. (Kent State University, 2008)
      This contribution proposes a decompositional iterative method with low memory requirements for the steadystate analysis ofKronecker structured Markov chains. The Markovian system is formed by a composition of subsystems ...
    • Distributed k-Core view materialization and maintenance for large dynamic graphs 

      Aksu, H.; Canim, M.; Chang, Yuan-Chi; Korpeoglu, I.; Ulusoy, O. (Institute of Electrical and Electronics Engineers, 2014-10)
      In graph theory, k-core is a key metric used to identify subgraphs of high cohesion, also known as the ‘dense’ regions of a graph. As the real world graphs such as social network graphs grow in size, the contents get ...
    • Distributed scheduling: a review of concepts and applications 

      Toptal, A.; Sabuncuoglu, I. (Taylor & Francis, 2010)
      Distributed scheduling (DS) is an approach that enables local decision makers to create schedules that consider local objectives and constraints within the boundaries of the overall system objectives. Local decisions from ...
    • Flora: a framework for decomposing software architecture to introduce local recovery 

      Sözer, H.; Tekinerdoǧan, B.; Akşit, M. (John Wiley & Sons Ltd., 2009-07)
      The decomposition of software architecture into modular units is usually driven by the required quality concerns. In this paper we focus on the impact of local recovery concern on the decomposition of the software system. ...
    • A Lagrangean relaxation and decomposition algorithm for the video placement and routing problem 

      Bektaş, T.; Oǧuz, O.; Ouveysi, I. (Elsevier, 2007)
      Video on demand (VoD) is a technology used to provide a number of programs to a number of users on request. In developing a VoD system, a fundamental problem is load balancing, which is further characterized by optimally ...
    • Lot sizing with perishable items 

      Arslan, Nazlıcan (Bilkent University, 2019-07)
      We address the uncapacitated lot sizing problem for a perishable item that has a deterministic and fixed lifetime. In the first part of the study, we assume that the demand is also deterministic. We conduct a polyhedral ...
    • Molecular entrapment of volatile organic compounds (VOCs) by electrospun cyclodextrin nanofibers 

      Celebioglu A.; Sen, H. S.; Durgun, E.; Uyar T. (Elsevier, 2016-02)
      In this paper, we reported the molecular entrapment performance of hydroxypropyl-beta-cyclodextrin (HPβCD) and hydroxypropyl-gamma-cyclodextrin (HPγCD) electrospun nanofibers (NF) for two common volatile organic compounds ...
    • A novel optimization algorithm for video placement and routing 

      Bektaş, T.; Oǧuz, O.; Ouveysi, I. (Institute of Electrical and Electronics Engineers, 2006)
      In this paper, we propose a novel optimization algorithm for the solution of the video placement and routing problem based on Lagrangean relaxation and decomposition. The main contribution can be stated as the use of integer ...
    • Parafac-spark: parallel tensor decompositions on spark 

      Bekçe, Selim Eren (Bilkent University, 2019-08)
      Tensors are higher order matrices, widely used in many data science applications and scienti c disciplines. The Canonical Polyadic Decomposition (also known as CPD/PARAFAC) is a widely adopted tensor factorization to ...
    • Substrate temperature influence on the properties of GaN thin films grown by hollow-cathode plasma-assisted atomic layer deposition 

      Alevli, M.; Gungor, N.; Haider A.; Kizir S.; Leghari, S. A.; Biyikli, N. (AIP Publishing LLC, 2016-02)
      Gallium nitride films were grown by hollow cathode plasma-assisted atomic layer deposition using triethylgallium and N2/H2 plasma. An optimized recipe for GaN film was developed, and the effect of substrate temperature was ...
    • Synthesis and characterization of iron oxide derivatized mutant cowpea mosaic virus hybrid nanoparticles 

      Martinez-Morales, A. A.; Portney, N. G.; Zhang, Y.; Destito, G.; Budak, G.; Özbay, Ekmel; Manchester, M.; Ozkan, C. S.; Ozkan, M. (Wiley - VCH Verlag GmbH & Co. KGaA, 2008)
      The enhanced local magnetic field strength was qualitatively analyzed by magnetic force microscopy (MFM), demonstrating a characteristic advantage for attaching derivatized magnetic iron oxide (IO) nanoparticles in an ...