Sciweavers

11211 search results - page 72 / 2243
» Rank-Sensitive Data Structures
Sort
View
KDD
2004
ACM
148views Data Mining» more  KDD 2004»
14 years 11 months ago
A quickstart in frequent structure mining can make a difference
Siegfried Nijssen, Joost N. Kok
IS
2010
13 years 9 months ago
Extracting a largest redundancy-free XML storage structure from an acyclic hypergraph in polynomial time
Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free ...
Wai Yin Mok, Joseph Fong, David W. Embley
CIKM
2010
Springer
13 years 9 months ago
SHRINK: a structural clustering algorithm for detecting hierarchical communities in networks
Community detection is an important task for mining the structure and function of complex networks. Generally, there are several different kinds of nodes in a network which are c...
Jianbin Huang, Heli Sun, Jiawei Han, Hongbo Deng, ...
SIAMMAX
2010
224views more  SIAMMAX 2010»
13 years 5 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
TMI
2010
155views more  TMI 2010»
13 years 5 months ago
Tubular Surface Segmentation for Extracting Anatomical Structures From Medical Imagery
Abstract--This work provides a model for tubular structures, and devises an algorithm to automatically extract tubular anatomical structures from medical imagery. Our model fits ma...
Vandana Mohan, Ganesh Sundaramoorthi, Allen Tannen...