Sciweavers

    1115 search results - page 81 / 223
    » Active Graph Cuts
    Sort
    View
    SPAA
    2004
    ACM
    250views Distributed And Parallel Com...» more  SPAA 2004»
    Balanced graph partitioning
    14 years 1 months ago
    Balanced graph partitioning
    Download  www.dcs.warwick.ac.uk
    We consider the problem of partitioning a graph into k components of roughly equal size while minimizing the capacity of the edges between different components of the cut. In part...
    Konstantin Andreev, Harald Räcke
    claim paper
    Read More »
    ENDM
    2007
    73views more  ENDM 2007»
    Two New Classes of Hamiltonian Graphs: (Extended Abstract)
    13 years 8 months ago
    Two New Classes of Hamiltonian Graphs: (Extended Abstract)
    Download  www.ams.sunysb.edu
    d Abstract) Esther M. Arkin 1 Applied Mathematics and Statistics Stony Brook University Stony Brook, USA Joseph S. B. Mitchell 2 Applied Mathematics and Statistics Stony Brook Univ...
    Esther M. Arkin, Joseph S. B. Mitchell, Valentin P...
    claim paper
    Read More »
    WG
    2007
    Springer
    98views Theoretical Computer Science» more  WG 2007»
    On Finding Graph Clusterings with Maximum Modularity
    14 years 2 months ago
    On Finding Graph Clusterings with Maximum Modularity
    Download  www.inf.uni-konstanz.de
    Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the compl...
    Ulrik Brandes, Daniel Delling, Marco Gaertler, Rob...
    claim paper
    Read More »
    COLING
    2008
    109views Computational Linguistics» more  COLING 2008»
    Exploiting Graph Structure for Accelerating the Calculation of Shortest Paths in Wordnets
    13 years 9 months ago
    Exploiting Graph Structure for Accelerating the Calculation of Shortest Paths in Wordnets
    Download  www.sfb441.uni-tuebingen.de
    This paper presents an approach for substantially reducing the time needed to calculate the shortest paths between all concepts in a wordnet. The algorithm exploits the unique &qu...
    Holger Wunsch
    claim paper
    Read More »
    FLAIRS
    2003
    160views Artificial Intelligence» more  FLAIRS 2003»
    Identifying Inhabitants of an Intelligent Environment Using a Graph-Based Data Mining System
    13 years 9 months ago
    Identifying Inhabitants of an Intelligent Environment Using a Graph-Based Data Mining System
    Download  www.aaai.org
    The goal of the MavHome smart home project is to build an intelligent home environment that is aware of its inhabitants and their activities. Such a home is designed to provide ma...
    Ritesh Mehta, Diane J. Cook, Lawrence B. Holder
    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.