Sciweavers

678 search results - page 8 / 136
» Structural Properties of Sparse Graphs
Sort
View
ICML
2009
IEEE
14 years 11 months ago
Group lasso with overlap and graph lasso
We propose a new penalty function which, when used as regularization for empirical risk minimization procedures, leads to sparse estimators. The support of the sparse vector is ty...
Laurent Jacob, Guillaume Obozinski, Jean-Philippe ...
ENTCS
2008
98views more  ENTCS 2008»
13 years 10 months ago
Modal Expressiveness of Graph Properties
Graphs are among the most frequently used structures in Computer Science. In this work, we analyze how we can express some important graph properties such as connectivity, acyclic...
Mario R. F. Benevides, L. Menasché Schechte...
KDD
2006
ACM
157views Data Mining» more  KDD 2006»
14 years 10 months ago
Using structure indices for efficient approximation of network properties
Statistics on networks have become vital to the study of relational data drawn from areas such as bibliometrics, fraud detection, bioinformatics, and the Internet. Calculating man...
Matthew J. Rattigan, Marc Maier, David Jensen
STOC
2000
ACM
112views Algorithms» more  STOC 2000»
14 years 2 months ago
A random graph model for massive graphs
We propose a random graph model which is a special case of sparse random graphs with given degree sequences. This model involves only a small number of parameters, called logsize ...
William Aiello, Fan R. K. Chung, Linyuan Lu
ISAAC
2010
Springer
230views Algorithms» more  ISAAC 2010»
13 years 8 months ago
Seidel Minor, Permutation Graphs and Combinatorial Properties
A permutation graph is an intersection graph of segments lying between two parallel lines. A Seidel complementation of a finite graph at a vertex v consists in complementing the ed...
Vincent Limouzy