Sciweavers

    11213 search results - page 73 / 2243
    » Low-contention data structures
    Sort
    View
    KDD
    2004
    ACM
    115views Data Mining» more  KDD 2004»
    A New Approach to Protein Structure Mining and Alignment
    16 years 4 months ago
    A New Approach to Protein Structure Mining and Alignment
    Download  www.cs.rpi.edu
    Hongyuan Li, Keith Marsolo, Srinivasan Parthasarat...
    claim paper
    Read More »
    73
    Voted
    KDD
    2004
    ACM
    148views Data Mining» more  KDD 2004»
    A quickstart in frequent structure mining can make a difference
    16 years 4 months ago
    A quickstart in frequent structure mining can make a difference
    Download  www.liacs.nl
    Siegfried Nijssen, Joost N. Kok
    claim paper
    Read More »
    121
    Voted
    IS
    2010
    94views Artificial Intelligence» more  IS 2010»
    Extracting a largest redundancy-free XML storage structure from an acyclic hypergraph in polynomial time
    15 years 2 months ago
    Extracting a largest redundancy-free XML storage structure from an acyclic hypergraph in polynomial time
    Download  www.deg.byu.edu
    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
    claim paper
    Read More »
    170
    Voted
    CIKM
    2010
    Springer
    166views Information Technology» more  CIKM 2010»
    SHRINK: a structural clustering algorithm for detecting hierarchical communities in networks
    15 years 2 months ago
    SHRINK: a structural clustering algorithm for detecting hierarchical communities in networks
    Download  www.cs.uiuc.edu
    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, ...
    claim paper
    Read More »
    139
    Voted
    SIAMMAX
    2010
    224views more  SIAMMAX 2010»
    Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices
    14 years 10 months ago
    Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices
    Download  www.math.purdue.edu
    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
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.