Browsing by Keywords "Graph theory"
Now showing items 120 of 51

Aberrant cerebral network topology and mild cognitive impairment in early Parkinson’s disease
(John Wiley & Sons, Inc., 20150506)The aim of this study was to assess whether mild cognitive impairment (MCI) is associatedwith disruption in largescale structural networks in newly diagnosed, drugna€ıve patients with Parkinson’s disease (PD). Graph ... 
Algorithms for effective querying of compound graphbased pathway databases
(BioMed Central Ltd., 2009)Background: Graphbased 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
(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 nearlinear algorithms are based on alternatebisection and ... 
Analysis of Lagrangian lower bounds for a graph partitioning problem
(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 crossmodal correlation discovery
(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 zeroerror list coding capacity
(Publ by IEEE, Piscataway, NJ, United States, 1993)We present a new bound on the zeroerror list coding capacity, and using which, show that the listof3 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
(Public Library of Science, 2017)The brain is a largescale 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 ... 
Cellgraph mining for breast tissue modeling and classification
(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
(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
(Institute of Electrical and Electronics Engineers, 201003)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
(Springer, 2004)We present a new compound graph layout algorithm based on traditional forcedirected layout scheme with extensions for nesting and other applicationspecific constraints. The algorithm has been successfully implemented ... 
Compromising system and user interests in shelter location and evacuation planning
(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 ... 
Costefficient approximation of linear systems with repeated and multichannel filtering configurations
(IEEE, Piscataway, NJ, United States, 1998)It is possible to obtain either exact realizations or useful approximations of linear systems or matrixvector products arising in many different applications, by synthesizing them in the form of repeated or multichannel ... 
Cournot competition in networked markets
(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
(Association for Computing Machinery, 2013)Compilers use softwarecontrolled local memories to provide fast, predictable, and powerefficient access to critical data. We show that the local memory allocation for straightline, or linearized programs is equivalent ... 
Detection of compound structures using clustering of statistical and structural features
(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
(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 communicationcost metrics in partitioning sparse rectangular matrices for parallel matrixvector multiplies
(SIAM, 2004)This paper addresses the problem of onedimensional partitioning of structurally unsymmetric square and rectangular sparse matrices for parallel matrixvector and matrixtransposevector multiplies. The objective is to ... 
Exploiting locality in sparse matrixmatrix multiplication on manycore rchitectures
(IEEE Computer Society, 2017)Exploiting spatial and temporal localities is investigated for efficient rowbyrow parallelization of general sparse matrixmatrix multiplication (SpGEMM) operation of the form C=A,B on manycore architectures. Hypergraph ... 
Fast optimal load balancing algorithms for 1D partitioning
(Academic Press, 2004)The onedimensional decomposition of nonuniform workload arrays with optimal load balancing is investigated. The problem has been studied in the literature as the "chainsonchains partitioning" problem. Despite the rich ...