Sciweavers

    83 search results - page 12 / 17
    » Graph Matching using Commute Time Spanning Trees
    Sort
    View
    CIKM
    2006
    Springer
    129views Information Technology» more  CIKM 2006»
    A system for query-specific document summarization
    13 years 11 months ago
    A system for query-specific document summarization
    Download  users.cs.fiu.edu
    There has been a great amount of work on query-independent summarization of documents. However, due to the success of Web search engines query-specific document summarization (que...
    Ramakrishna Varadarajan, Vagelis Hristidis
    claim paper
    Read More »
    PDPTA
    2007
    106views Distributed And Parallel Com...» more  PDPTA 2007»
    Two Graph Algorithms On an Associative Computing Model
    13 years 9 months ago
    Two Graph Algorithms On an Associative Computing Model
    Download  faculty.uncfsu.edu
    - The MASC (for Multiple Associative Computing) model is a SIMD model enhanced with associative properties and multiple synchronous instruction streams (IS). A number of algorithms...
    Mingxian Jin, Johnnie W. Baker
    claim paper
    Read More »
    SODA
    1996
    ACM
    95views Algorithms» more  SODA 1996»
    RNC Algorithms for the Uniform Generation of Combinatorial Structures
    13 years 9 months ago
    RNC Algorithms for the Uniform Generation of Combinatorial Structures
    Download  www.csc.liv.ac.uk
    We describe several RNC algorithms for generating graphs and subgraphs uniformly at random. For example, unlabelled undirected graphs are generated in O(lg3 n) time using O n2 lg3...
    Michele Zito, Ida Pu, Martyn Amos, Alan Gibbons
    claim paper
    Read More »
    ICDCSW
    2009
    IEEE
    141views Computer Networks» more  ICDCSW 2009»
    A Geometric Routing Protocol in Disruption Tolerant Network
    14 years 2 months ago
    A Geometric Routing Protocol in Disruption Tolerant Network
    Download  people.scs.carleton.ca
    We describe a novel Geometric Localized Routing (GLR) protocol in Disruption (Delay) Tolerant Network (DTN). Although DTNs do not guarantee the connectivity of the network all the...
    Jingzhe Du, Evangelos Kranakis, Amiya Nayak
    claim paper
    Read More »
    ISBRA
    2009
    Springer
    97views Bioinformatics» more  ISBRA 2009»
    Untangling Tanglegrams: Comparing Trees by Their Drawings
    14 years 2 months ago
    Untangling Tanglegrams: Comparing Trees by Their Drawings
    Download  www.cs.ucdavis.edu
    A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology – to compare evolutiona...
    Balaji Venkatachalam, Jim Apple, Katherine St. Joh...
    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.