Now showing items 1-20 of 51

    • Aberrant cerebral network topology and mild cognitive impairment in early Parkinson’s disease 

      Pereira, J. B.; Aarsland, D.; Ginestet, C. E.; Lebedev, A. V.; Wahlund, L. O.; Simmons, A.; Volpe, G.; Westman, E. (John Wiley & Sons, Inc., 2015-05-06)
      The aim of this study was to assess whether mild cognitive impairment (MCI) is associatedwith disruption in large-scale structural networks in newly diagnosed, drug-na€ıve patients with Parkin-son’s disease (PD). Graph ...
    • Algorithms for effective querying of compound graph-based pathway databases 

      Dogrusoz, U.; Cetintas, A.; Demir, E.; Babur, O. (BioMed Central Ltd., 2009)
      Background: Graph-based pathway ontologies and databases are widely used to represent data about cellular processes. This representation makes it possible to programmatically integrate cellular networks and to investigate ...
    • Algorithms for Layout of Disconnected Graphs 

      Dogrusoz, U. (2000)
      We present efficient algorithms for the layout of disconnected objects in a graph (isolated nodes and components) for a specified aspect ratio. These linear and near-linear algorithms are based on alternate-bisection and ...
    • Analysis of Lagrangian lower bounds for a graph partitioning problem 

      Adil, G. K.; Ghosh, J. B. (Institute for Operations Research and the Management Sciences (INFORMS), 1999)
      Recently, Ahmadi and Tang (1991) demonstrated how various manufacturing problems can be modeled and solved as graph partitioning problems. They use Lagrangian relaxation of two different mixed integer programming formulations ...
    • Automatic multimedia cross-modal correlation discovery 

      Pan J.-Y.; Yang H.-J.; Faloutsos, C.; Duygulu P. (2004)
      Given an image (or video clip, or audio song), how do we automatically assign keywords to it? The general problem is to find correlations across the media in a collection of multimedia objects like video clips, with colors, ...
    • A Bound on the zero-error list coding capacity 

      Arikan, E. (Publ by IEEE, Piscataway, NJ, United States, 1993)
      We present a new bound on the zero-error list coding capacity, and using which, show that the list-of-3 capacity of the 4/3 channel is at most 6/19 bits, improving the best previously known bound of 3/8. The relation of ...
    • BRAPH: A graph theory software for the analysis of brain connectivity 

      Mijalkov, M.; Kakaei, E.; Pereira, J. B.; Westman, E.; Volpe, G. (Public Library of Science, 2017)
      The brain is a large-scale complex network whose workings rely on the interaction between its various regions. In the past few years, the organization of the human brain network has been studied extensively using concepts ...
    • Cell-graph mining for breast tissue modeling and classification 

      Bilgin, C.; Demir, C.; Nagi, C.; Yener, B. (2007)
      We consider the problem of automated cancer diagnosis in the context of breast tissues. We present graph theoretical techniques that identify and compute quantitative metrics for tissue characterization and classification. ...
    • Color graph representation for structural analysis of tissue images 

      Altunbay, Doğan (Bilkent University, 2010)
      Computer aided image analysis tools are becoming increasingly important in automated cancer diagnosis and grading. They have the potential of assisting pathologists in histopathological examination of tissues, which may ...
    • Color graphs for automated cancer diagnosis and grading 

      Altunbay, D.; Cigir, C.; Sokmensuer, C.; Gunduz Demir, C. (Institute of Electrical and Electronics Engineers, 2010-03)
      This paper reports a new structural method to mathematically represent and quantify a tissue for the purpose of automated and objective cancer diagnosis and grading. Unlike the previous structural methods, which quantify ...
    • A compound graph layout algorithm for biological pathways 

      Dogrusoz, U.; Giral, E.; Cetintas, A.; Civril, A.; Demir, E. (Springer, 2004)
      We present a new compound graph layout algorithm based on traditional force-directed layout scheme with extensions for nesting and other application-specific constraints. The algorithm has been successfully implemented ...
    • Compromising system and user interests in shelter location and evacuation planning 

      Bayram V.; Tansel, B.T.; Yaman H. (Elsevier Ltd, 2015)
      Traffic management during an evacuation and the decision of where to locate the shelters are of critical importance to the performance of an evacuation plan. From the evacuation management authority's point of view, the ...
    • Cost-efficient approximation of linear systems with repeated and multi-channel filtering configurations 

      Kutay, M. A.; Erden, M. F.; Ozaktas, H. M.; Arikan, O.; Candan, Ç.; Güleryüz, Ö. (IEEE, Piscataway, NJ, United States, 1998)
      It is possible to obtain either exact realizations or useful approximations of linear systems or matrix-vector products arising in many different applications, by synthesizing them in the form of repeated or multi-channel ...
    • Cournot competition in networked markets 

      Bimpikis, K.; Ehsani, S.; Ilkiliç, R. (Association for Computing Machinery, 2014)
      The paper considers a model of competition among firms that produce a homogeneous good in a networked environment. A bipartite graph determines which subset of markets a firm can supply to. Firms compete a la Cournot and ...
    • A decoupled local memory allocator 

      Diouf, B.; Hantaş, C.; Cohen, A.; Özturk, Ö.; Palsberg, J. (Association for Computing Machinery, 2013)
      Compilers use software-controlled local memories to provide fast, predictable, and power-efficient access to critical data. We show that the local memory allocation for straight-line, or linearized programs is equivalent ...
    • Detection of compound structures using clustering of statistical and structural features 

      Akçay H.G.; Aksoy, S. (2012)
      We describe a new method for detecting compound structures in images by combining the statistical and structural characteristics of simple primitive objects. A graph is constructed by assigning the primitive objects to its ...
    • An effective model to decompose linear programs for parallel solution 

      Pınar, A.; Aykanat, C. (Springer Verlag, 1996)
      Although inherent parallelism in the solution of block angulax Linear Programming (LP) problems has been exploited in many research works, the literature that addresses decomposing constraint matrices into block angular ...
    • Encapsulating multiple communication-cost metrics in partitioning sparse rectangular matrices for parallel matrix-vector multiplies 

      Uçar, B.; Aykanat, C. (SIAM, 2004)
      This paper addresses the problem of one-dimensional partitioning of structurally unsymmetric square and rectangular sparse matrices for parallel matrix-vector and matrix-transpose-vector multiplies. The objective is to ...
    • Exploiting locality in sparse matrix-matrix multiplication on many-core rchitectures 

      Akbudak K.; Aykanat, C. (IEEE Computer Society, 2017)
      Exploiting spatial and temporal localities is investigated for efficient row-by-row parallelization of general sparse matrix-matrix multiplication (SpGEMM) operation of the form C=A,B on many-core architectures. Hypergraph ...
    • Fast optimal load balancing algorithms for 1D partitioning 

      Pınar, A.; Aykanat, C. (Academic Press, 2004)
      The one-dimensional decomposition of nonuniform workload arrays with optimal load balancing is investigated. The problem has been studied in the literature as the "chains-on-chains partitioning" problem. Despite the rich ...