Sciweavers

678 search results - page 26 / 136
» Structural Properties of Sparse Graphs
Sort
View
SIAMMAX
2010
224views more  SIAMMAX 2010»
13 years 3 months ago
Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices
Abstract. Given a symmetric positive definite matrix A, we compute a structured approximate Cholesky factorization A RT R up to any desired accuracy, where R is an upper triangula...
Jianlin Xia, Ming Gu
BC
2006
80views more  BC 2006»
13 years 9 months ago
Sparse Spatial Sampling for the Computation of Motion in Multiple Stages
The avian retino-tecto-rotundal pathway plays a central role in motion analysis and features complex connectivity. Yet, the relation between the pathway's structural arrangeme...
Alireza S. Mahani, Reza Khanbabaie, Harald Luksch,...
IOR
2011
175views more  IOR 2011»
13 years 3 months ago
Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
This paper introduces and studies the maximum k-plex problem, which arises in social network analysis and has wider applicability in several important areas employing graph-based ...
Balabhaskar Balasundaram, Sergiy Butenko, Illya V....
EVOW
2006
Springer
14 years 18 days ago
Effects of Scale-Free and Small-World Topologies on Binary Coded Self-adaptive CEA
In this paper we investigate the properties of CEAs with populations structured as Watts
Mario Giacobini, Mike Preuss, Marco Tomassini
ISAAC
1992
Springer
125views Algorithms» more  ISAAC 1992»
14 years 1 months ago
A Simple Test for the Consecutive Ones Property
A (0,1)-matrix satisfies the consecutive ones property if there exists a column permutation such that the ones in each row of the resulting matrix are consecutive. Booth and Lueke...
Wen-Lian Hsu