332,944 Hits in 13.5 sec

Aberrant Functional Whole-Brain Network Architecture in Patients With Schizophrenia: A Meta-analysis

Joseph Kambeitz, Lana Kambeitz-Ilankovic, Carlos Cabral, Dominic B. Dwyer, Vince D. Calhoun, Martijn P. van den Heuvel, Peter Falkai, Nikolaos Koutsouleris, Berend Malchow
2016 Schizophrenia Bulletin  
By using graph-analytical measures, recent studies indicate that patients with schizophrenia exhibit changes in the organizational principles of whole-brain networks and that these changes relate to cognitive  ...  A comprehensive literature search was conducted to identify all available functional graph-analytical studies in patients with schizophrenia.  ...  ., and B.M. declare no conflicts of interest.  ... 
doi:10.1093/schbul/sbv174 pmid:27460615 pmcid:PMC4960431 fatcat:gwfa5qgfzvcnbirk5ocqzu6cau

Fast Flux Module Detection Using Matroid Theory [chapter]

Arne C. Müller, Frank J. Bruggeman, Brett G. Olivier, Leen Stougie
2014 Lecture Notes in Computer Science  
Specifically, we show that our modules correspond one-to-one to so-called separators of an appropriate matroid.  ...  The analysis of the optimal-yield flux space has been an open challenge.  ...  Acknowledgments We thank Timo Maarleveld for providing us with runtime data of the method by [9] .  ... 
doi:10.1007/978-3-319-05269-4_16 fatcat:uec3ywfrmvgfrjtcfcwpcrfo6e

Networks That Optimize a Trade-Off between Efficiency and Dynamical Resilience [chapter]

Markus Brede, Bert J. M. de Vries
2009 Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering  
Best efficiency is realized in starlike configurations, while enhanced resilience is related to the avoidance of short loops and degree homogeneity.  ...  While the first is related to the average shortest pathlength, we argue that the second can be measured by the largest eigenvalue of the adjacency matrix of the network.  ...  A more thorough analysis is performed in Fig. 4 which gives the change of various network characteristics with the value of α.  ... 
doi:10.1007/978-3-642-02469-6_87 fatcat:tnwfsrem5jbq7bio4eynk4vdcy

Mathematical programming models for some smallest-world problems

Jay M. Rosenberger, H.W. Corley
2005 Nonlinear Analysis: Real world applications  
Given a weighted graph G, in the minimum-cost-edge-selection problem (MCES), a minimum weighted set of edges is chosen subject to an upper bound on the diameter of graph G.  ...  Similarly, in the minimum-diameter-edge-selection problem (MDES), a set of edges is chosen to minimize the diameter subject to an upper bound on their total weight.  ...  For graphs G = (V, E) with a large number of vertices, finding the P ij and P ij (e) requires an efficient enumeration procedure.  ... 
doi:10.1016/j.nonrwa.2005.02.001 fatcat:s5u44zgjlnfibazjzzvtad4ela

Target detection in hyperspectral images based on independent component analysis

Stefan A. Robila, Pramod K. Varshney, Firooz A. Sadjadi
2002 Automatic Target Recognition XII  
It then separates the features present in the image using an ICA based algorithm. The method involves a gradient descent minimization of the mutual information between frames.  ...  The paper presents an algorithm based on Independent Component Analysis (ICA) for the detection of small targets present in hyperspectral images.  ...  The results indicate that ICA provides an efficient way to separate features present in a scene.  ... 
doi:10.1117/12.477024 fatcat:5muxls5pu5fhnij7f3cusgr26m

An Energy Model for Visual Graph Clustering [chapter]

Andreas Noack
2004 Lecture Notes in Computer Science  
The drawings of the best-known force and energy models do not clearly show clusters for graphs whose diameter is small relative to the number of nodes.  ...  We introduce an energy model whose minimum energy drawings reveal the clusters of the drawn graph. Here a cluster is a set of nodes with many internal edges and few edges to nodes outside the set.  ...  The LinLog model complements well-known force and energy models like the Fruchterman-Reingold model which do not separate the clusters of graphs with small diameter well.  ... 
doi:10.1007/978-3-540-24595-7_40 fatcat:fw3c26eyyna4thx4o3mmjtuueq

Solving Classification Problem using Reduced Dimension and Eigen Structure in RSVM

Meeta Pal, Deepshikha Bhati, Baijnath Kaushik, Haider Banka
2015 International Journal of Computer Applications  
This minimize the task of classification by propose method and cost is reduced while efficiency is improved with the increase complexity of data.  ...  The problem with complex dataset incurs significant complexity while classifying and its efficiency also cost very much.  ...  In conventional SVM as well as many kernel-based learning algorithms [3] - [5] , generating a nonlinear separating surface has to deal with a fully dense kernel matrix with the size of the number of  ... 
doi:10.5120/20682-3537 fatcat:itws7kifxjfttn4263vjqhuzaa

Computer-Aided Geometric Sensitivity Analysis of Plane Trusses with a Square Grid Topology

Péter Dóbé, Gábor Domokos
2014 Periodica Polytechnica Electrical Engineering and Computer Science  
The vertex set V of the topology graph is in one-to-one correspondence with the set of joints in the truss. Likewise, the edge set E is in one-to-one correspondence with the set of bars.  ...  A recent theory assigns a single scalar 0 ≤ r ≤ 1 to pin-jointed plane trusses, characterising their geometric sensitivity with respect to small displacements of individual joints.  ...  Topology graphs of rigid trusses are called generically rigid graphs, and those of minimally rigid trusses are called minimally generically rigid graphs [21] .  ... 
doi:10.3311/ppee.2207 fatcat:s5ddtqh6nje6dfrloa5o4hwlei

Factorization-Based Graph Repartitionings [chapter]

Kateřina Jurková, Miroslav Tůma
2010 Lecture Notes in Computer Science  
The paper deals with the parallel computation of matrix factorization using graph partitioning-based domain decomposition.  ...  It is well-known that the partitioned graph may have both a small separator and well-balanced domains but sparse matrix decompositions on domains can be completely unbalanced.  ...  The elimination tree T is the rooted tree with the same vertex set as the adjacency graph G of A and with the vertex n as its root.  ... 
doi:10.1007/978-3-642-12535-5_92 fatcat:xyoiayjaongshil2rsgay6ttqa

Large-Scale Graph Visualization and Analytics

Kwan-Liu Ma, Chris W. Muelder
2013 Computer  
GRAPH SIMPLIFICATION Even with optimizations, directly laying out an entire graph with tens of millions of nodes or edges does not always lend itself well to detailed analysis.  ...  Timing is based on the use of a Mac Pro with a 2.66-GHz Intel Xeon CPU. space and that clusters are clearly separated.  ...  Kwan-Liu Ma is a professor of computer science at the IEEE Computer Graphics and Applications bridges the theory and practice of computer graphics.  ... 
doi:10.1109/mc.2013.242 fatcat:odcob6nwwrf33az4ro4dk2ssau

Small-World Brain Networks

Danielle Smith Bassett, Ed Bullmore
2006 The Neuroscientist  
length of a random graph, which they called small-world networks.  ...  The authors introduce some of the key mathematical concepts in graph theory required for small-world analysis and review how these methods have been applied to quantification of cortical connectivity matrices  ...  Wiring Costs and Small-World Brain Networks Several aspects of brain structure are compatible with a selection pressure to minimize wiring costs: the segregation of white and gray matter, separation of  ... 
doi:10.1177/1073858406293182 pmid:17079517 fatcat:wzr6jiwijffgxibt7vszq2c27y

A Statistically Efficient and Scalable Method for Exploratory Analysis of High-Dimensional Data

Mohammad S. Rahman, Gholamreza Haffari
2020 SN Computer Science  
Current methods for graphical model structure discovery either do not scale well to datasets with large sample sizes, or suffer from high false discovery rates when the number of dimensions is much larger  ...  We present extensive empirical results on synthetic data with different sample, variable, clique and inverse correlation coefficient and show that our method outperforms strong baselines in terms of both  ...  Compliances with Ethical Standard Conflict of interest The authors declare that they have no conflict of interest.  ... 
doi:10.1007/s42979-020-0064-2 fatcat:xiat3sx7e5h2jhxb37j2uwhl7q

Page 7194 of Mathematical Reviews Vol. , Issue 95m [page]

1995 Mathematical Reviews  
Summary: “We present efficient parallel algorithms for find- ing a minimal 2-edge-connected spanning subgraph of a 2-edge-connected graph and finding a minimal biconnected spanning subgraph of a biconnected  ...  We consider the problem of constructing a ‘small’ minor G’ of G that is ‘equivalent’ to G with respect to the problem I.  ... 

A Novel Approach Canberra Measure Minimal Spanning Tree Using Fuzzy C-Means Based on Gaussian Function for Image Data Mining

null Senthil
2018 Automation Control and Intelligent Systems  
An efficient method for calculating membership and updating prototypes by minimizing the new objective function of Gaussian based fuzzy c-means.  ...  The performance of proposed algorithm has been shown with random data set, partition coefficient and validation function are used to evaluate the validity of clustering and then new cluster separation  ...  David chandrakumar, Professor, Department of Mathematics, Vickram College of Engineering for his encouragement and support given.  ... 
doi:10.11648/j.acis.20180605.11 fatcat:n37qpovchjct5fnyowpcgamvzi

An approach to solving large-scale SLAM problems with a small memory footprint

Benjamin Suger, Gian Diego Tipaldi, Luciano Spinello, Wolfram Burgard
2014 2014 IEEE International Conference on Robotics and Automation (ICRA)  
Our approach achieves this based on a hierarchical decomposition consisting of small submaps with limited size. We perform extensive experiments on synthetic and publicly available datasets.  ...  In this paper, we consider the SLAM problem from the point of view of memory consumption and present a novel approximate approach to SLAM with low memory consumption.  ...  All authors are with the University of Freiburg, Institute of Computer Science, 79110 Freiburg, Germany. This work has partly been supported by the European Commission under the grant no.  ... 
doi:10.1109/icra.2014.6907384 dblp:conf/icra/SugerTSB14 fatcat:vbdcakd7rzf3dfkykxeowzgo24
« Previous Showing results 1 — 15 out of 332,944 results