Recent Submissions

  • Emerging accelerator platforms for data centers 

    Ozdal, M. M. (Institute of Electrical and Electronics Engineers, 2017-12-04)
    CPU and GPU platforms may not be the best options for many emerging compute patterns, which led to a new breed of emerging accelerator platforms. This article gives a comprehensive overview with a focus on commercial platforms.
  • A Template-Based Design Methodology for Graph-Parallel Hardware Accelerators 

    Ayupov, A.; Yesil, S.; Ozdal, M. M.; Kim, T.; Burns, S.; Ozturk, O. (Institute of Electrical and Electronics Engineers Inc., 2017-05-19)
    Graph applications have been gaining importance in the last decade due to emerging big data analytics problems such as Web graphs, social networks, and biological networks. For these applications, traditional CPU and GPU ...
  • Graph Analytics Accelerators for Cognitive Systems 

    Ozdal, M. M.; Yesil S.; Kim T.; Ayupov A.; Greth J.; Burns S.; Ozturk O. (Institute of Electrical and Electronics Engineers, 2017)
    Hardware accelerators are known to be performance and power efficient. This article focuses on accelerator design for graph analytics applications, which are commonly used kernels for cognitive systems. The authors propose ...
  • Concurrent rule execution in active databases 

    Saygin, Y.; Ulusoy, O.; Chakravarthy, S. (Elsevier, 1998-03)
    An active DBMS is expected to support concurrent as well as sequential rule execution in an efficient manner. Nested transaction model is a suitable tool to implement rule execution as it can handle nested rule firing ...
  • A Matrix Partitioning Interface to PaToH in MATLAB 

    Ucar, B.; Catalyurek, U. V.; Aykanat, C. (Elsevier, 2010-06)
    We present the PaToH MATLAB Matrix Partitioning Interface. The interface provides support for hypergraph-based sparse matrix partitioning methods which are used for efficient parallelization of sparse matrix-vector ...
  • A new mapping heuristic based on mean field annealing 

    Bultan, T.; Aykanat, C. (Elsevier, 1992-12)
    A new mapping heuristic is developed, based on the recently proposed Mean Field Annealing (MFA) algorithm. An e cient implementation scheme, which decreases the complexity of the proposed algorithm by asymptotical factors, ...
  • Cross-document word matching for segmentation and retrieval of Ottoman divans 

    Duygulu, P.; Arifoglu, D.; Kalpakli, M. (Springer London, 2014-10-09)
    Motivated by the need for the automatic indexing and analysis of huge number of documents in Ottoman divan poetry, and for discovering new knowledge to preserve and make alive this heritage, in this study we propose a novel ...
  • Diagnosis of gastric carcinoma by classification on feature projections 

    Guvenir, H. A.; Emeksiz, N.; Ikizler, N.; Ormeci, N. (Elsevier, 2004-07)
    A new classification algorithm, called benefit maximizing classifier on feature projections (BCFP), is developed and applied to the problem of diagnosis of gastric carcinoma. The domain contains records of patients with ...
  • Hardware/software approaches for reducing the process variation impact on instruction fetches 

    Kadayif, I.; Turkcan, M.; Kiziltepe, S.; Ozturk, O. (ACM New York, NY, USA, 2013-10)
    As technology moves towards finer process geometries, it is becoming extremely difficult to control critical physical parameters such as channel length, gate oxide thickness, and dopant ion concentration. Variations in ...
  • Reconstructing complex regions of genomes using long-read sequencing technology 

    Huddleston, J.; Ranade, S.; Malig, M.; Antonacci, F.; Chaisson, M.; Hon, L.; Sudmant, P. H.; Alkan, C.; Eichler, E. E. (Cold Spring Harbor Laboratory Press, 2014-01-09)
    Obtaining high-quality sequence continuity of complex regions of recent segmental duplication remains one of the major challenges of finishing genome assemblies. In the human and mouse genomes, this was achieved by targeting ...
  • A parallel progressive radiosity algorithm based on patch data circulation 

    Aykanat, C.; Capin, T.; Ozguc, B. (Elsevier, 1996-03)
    Current research on radiosity has concentrated on increasing the accuracy and the speed of the solution. Although algorithmic and meshing techniques decrease the execution time, still excessive computational power is ...
  • Cost-aware strategies for query result caching in web search engines 

    Ozcan, R.; Sengor Altingovde, I.; Ulusoy, O. (Association for Computing Machinery, Inc., 2011-05-01)
    Search engines and large-scale IR systems need to cache query results for efficiency and scalability purposes. Static and dynamic caching techniques (as well as their combinations) are employed to effectively cache query ...
  • Procedural visualization of knitwear and woven cloth 

    Durupinar, F.; Gudukbay, U. (Elsevier, 2007-10)
    In this paper, a procedural method for the visualization of knitted and woven fabrics is presented. The proposed method is compatible with a mass-spring model and makes use of the regular warp-weft structure of the cloth. ...
  • Integrative analysis of complex cancer genomics and clinical profiles using the cBioPortal 

    Gao, J.; Aksoy, B. A.; Dogrusoz, U.; Dresdner, G.; Gross, B.; Sumer, S. O.; Sun, Y.; Jacobsen, A.; Sinha, R.; Larsson, E.; Cerami, E.; Sander, C.; Schultz, N. (Science Signaling, 2013-04-02)
    The cBioPortal for Cancer Genomics (http://cbioportal.org) provides a Web resource for exploring, visualizing, and analyzing multidimensional cancer genomics data. The portal reduces molecular profiling data from cancer ...
  • A discretization method based on maximizing the area under receiver operating characteristic curve 

    Kurtcephe, M.; Guvenir, H. A. (World Scientific Publishing Company, 2013-02-21)
    Many machine learning algorithms require the features to be categorical. Hence, they require all numeric-valued data to be discretized into intervals. In this paper, we present a new discretization method based on the ...
  • A line-based representation for matching words in historical manuscripts 

    Can, E. F.; Duygulu, P. (Elsevier, 2011-06-01)
    In this study, we propose a new method for retrieving and recognizing words in historical documents. We represent word images with a set of line segments. Then we provide a criterion for word matching based on matching the ...
  • Simultaneous input and output matrix partitioning for outer-product-parallel sparse matrix-matrix multiplication 

    Akbudak, K.; Aykanat, C. (Society for Industrial and Applied Mathematics, 2014-10-23)
    FFor outer-product-parallel sparse matrix-matrix multiplication (SpGEMM) of the form C=A×B, we propose three hypergraph models that achieve simultaneous partitioning of input and output matrices without any replication of ...
  • mESAdb: microRNA expression and sequence analysis database 

    Kaya, K.; Karakulah, G.; Yakicier, C.; Acar, A. C.; Konu, O. (Oxford University Press, 2011-01-01)
    microRNA expression and sequence analysis database (http://konulab.fen.bilkent.edu.tr/mirna/) (mESAdb) is a regularly updated database for the multivariate analysis of sequences and expression of microRNAs from multiple ...
  • Performance measures for object detection evaluation 

    Ozdemir, B.; Aksoy, S.; Eckert, S.; Pesaresi, M.; Ehrlich, D. (Elsevier, 2010-06-15)
    We propose a new procedure for quantitative evaluation of object detection algorithms. The procedure consists of a matching stage for finding correspondences between reference and output objects, an accuracy score that is ...
  • A multi-graph approach to complexity management in interactive graph visualization 

    Dogrusoz, U.; Genc, B. (Elsevier, 2006-02)
    In this paper we describe a new, multi-graph approach for development of a comprehensive set of complexity management techniques for interactive graph visualization tools. This framework facilitates efficient implementation ...

View more