Sciweavers

    796 search results - page 134 / 160
    » The Anonymous Subgraph Problem
    Sort
    View
    IPL
    2007
    101views more  IPL 2007»
    Adjacency queries in dynamic sparse graphs
    13 years 8 months ago
    Adjacency queries in dynamic sparse graphs
    Download  www.mimuw.edu.pl
    We deal with the problem of maintaining a dynamic graph so that queries of the form “is there an edge between u and v?” are processed fast. We consider graphs of bounded arbor...
    Lukasz Kowalik
    claim paper
    Read More »
    IJCBDD
    2010
    127views more  IJCBDD 2010»
    Predicting protein complexes by data integration of different types of interactions
    13 years 7 months ago
    Predicting protein complexes by data integration of different types of interactions
    Download  www.sfu.ca
    : The explosion of highthroughput interaction data from proteomics studies gives us the opportunity to integrate Protein-Protein Interactions (PPI) from different type of interacti...
    Powell Patrick Cheng Tan, Daryanaz Dargahi, Freder...
    claim paper
    Read More »
    PVLDB
    2010
    129views more  PVLDB 2010»
    Graph Pattern Matching: From Intractable to Polynomial Time
    13 years 6 months ago
    Graph Pattern Matching: From Intractable to Polynomial Time
    Download  www.comp.nus.edu.sg
    Graph pattern matching is typically defined in terms of subgraph isomorphism, which makes it an np-complete problem. Moreover, it requires bijective functions, which are often to...
    Wenfei Fan, Jianzhong Li, Shuai Ma, Nan Tang, Ying...
    claim paper
    Read More »
    ICMLA
    2009
    169views Machine Learning» more  ICMLA 2009»
    Learning Probabilistic Structure Graphs for Classification and Detection of Object Structures
    13 years 6 months ago
    Learning Probabilistic Structure Graphs for Classification and Detection of Object Structures
    Download  www.ipb.uni-bonn.de
    Abstract--This paper presents a novel and domainindependent approach for graph-based structure learning. The approach is based on solving the Maximum Common SubgraphIsomorphism pro...
    Johannes Hartz
    claim paper
    Read More »
    NETWORKS
    2011
    226views Computer Networks» more  NETWORKS 2011»
    On cut-based inequalities for capacitated network design polyhedra
    13 years 3 months ago
    On cut-based inequalities for capacitated network design polyhedra
    Download  www.matheon.de
    In this article we study capacitated network design problems. We unify and extend polyhedral results for directed, bidirected and undirected link capacity models. Based on valid i...
    Christian Raack, Arie M. C. A. Koster, Sebastian O...
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.