Sciweavers

463 search results - page 86 / 93
» The lattice dimension of a graph
Sort
View
APVIS
2006
14 years 11 months ago
Visual analysis of network centralities
Centrality analysis determines the importance of vertices in a network based on their connectivity within the network structure. It is a widely used technique to analyse network-s...
Tim Dwyer, Seok-Hee Hong, Dirk Koschützki, Fa...
80
Voted
ICML
2010
IEEE
14 years 10 months ago
Online Learning for Group Lasso
We develop a novel online learning algorithm for the group lasso in order to efficiently find the important explanatory factors in a grouped manner. Different from traditional bat...
Haiqin Yang, Zenglin Xu, Irwin King, Michael R. Ly...
APPML
2007
92views more  APPML 2007»
14 years 9 months ago
Topological grammars for data approximation
A method of topological grammars is proposed for multidimensional data approximation. For data with complex topology we define a principal cubic complex of low dimension and give...
Alexander N. Gorban, Neil R. Sumner, Andrei Yu. Zi...
IPL
2007
71views more  IPL 2007»
14 years 9 months ago
Fault-tolerant analysis of a class of networks
In this paper, we explore the 2-extraconnectivity of a special class of graphs G(G0,G1;M) proposed by Chen et al. [Y.-C. Chen, J.J.M. Tan, L.-H. Hsu, S.-S. Kao, Super-connectivity...
Jun-Ming Xu, Qiang Zhu 0003, Min Xu
JCB
2007
168views more  JCB 2007»
14 years 9 months ago
Fast Molecular Shape Matching Using Contact Maps
In this paper, we study the problem of computing the similarity of two protein structures ring their contact-map overlap. Contact-map overlap abstracts the problem of computing th...
Pankaj K. Agarwal, Nabil H. Mustafa, Yusu Wang