Sciweavers

    1132 search results - page 64 / 227
    » Similarity Graphs
    Sort
    View
    DM
    2007
    136views more  DM 2007»
    Lower connectivities of regular graphs with small diameter
    14 years 9 months ago
    Lower connectivities of regular graphs with small diameter
    Download  www-ma3.upc.es
    Krishnamoorthy, Thulasiraman and Swamy [Minimum order graphs with specified diameter, connectivity and regularity, Networks 19 (1989) 25–46] showed that a δ-regular graph with...
    Camino Balbuena, Xavier Marcote
    claim paper
    Read More »
    JGAA
    2007
    135views more  JGAA 2007»
    Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
    14 years 9 months ago
    Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
    Download  www.emis.de
    Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
    Donatello Conte, Pasquale Foggia, Mario Vento
    claim paper
    Read More »
    JPDC
    2007
    138views more  JPDC 2007»
    Distributed computation of the knn graph for large high-dimensional point sets
    14 years 9 months ago
    Distributed computation of the knn graph for large high-dimensional point sets
    Download  faculty.cua.edu
    High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
    Erion Plaku, Lydia E. Kavraki
    claim paper
    Read More »
    WSDM
    2009
    ACM
    187views Data Mining» more  WSDM 2009»
    Speeding up algorithms on compressed web graphs
    15 years 4 months ago
    Speeding up algorithms on compressed web graphs
    Download  wsdm2009.org
    A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
    Chinmay Karande, Kumar Chellapilla, Reid Andersen
    claim paper
    Read More »
    ICMCS
    2008
    IEEE
    165views Multimedia» more  ICMCS 2008»
    Graph cuts by using local texture features of wavelet coefficient for image segmentation
    15 years 4 months ago
    Graph cuts by using local texture features of wavelet coefficient for image segmentation
    Download  www.me.cs.scitec.kobe-u.ac.jp
    This paper proposes an approach to image segmentation using Iterated Graph Cuts based on local texture features of wavelet coefficient. Using Multiresolution Analysis based on Ha...
    Keita Fukuda, Tetsuya Takiguchi, Yasuo Ariki
    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-2025, USA.