Sciweavers

    1532 search results - page 244 / 307
    » Connection Relations in Mereotopology
    Sort
    View
    CCCG
    2007
    123views Computational Geometry» more  CCCG 2007»
    On Bus Graph Realizability
    13 years 11 months ago
    On Bus Graph Realizability
    Download  www.cs.mcgill.ca
    In this paper, we consider the following graph embedding problem: Given a bipartite graph G = (V1, V2; E), where the maximum degree of vertices in V2 is 4, can G be embedded on a t...
    Anil Ada, Melanie Coggan, Paul Di Marco, Alain Doy...
    claim paper
    Read More »
    BIS
    2008
    114views Business» more  BIS 2008»
    Determining Relevant Deep Web Sites by Query Context Identification
    13 years 11 months ago
    Determining Relevant Deep Web Sites by Query Context Identification
    Download  sunsite.informatik.rwth-aachen.de
    Deep web search requires a transformation between search keywords and semantically described and well-formed data structures. We approached this problem in our "In the Web of ...
    Zsolt Tivadar Kardkovács, Domonkos Tikk
    claim paper
    Read More »
    DICTA
    2008
    261views Applied Computing» more  DICTA 2008»
    Exploiting Part-Based Models and Edge Boundaries for Object Detection
    13 years 11 months ago
    Exploiting Part-Based Models and Edge Boundaries for Object Detection
    Download  www.nada.kth.se
    This paper explores how to exploit shape information to perform object class recognition. We use a sparse partbased model to describe object categories defined by shape. The spars...
    Josephine Sullivan, Oscar M. Danielsson, Stefan Ca...
    claim paper
    Read More »
    LREC
    2010
    189views Education» more  LREC 2010»
    Constructing an Annotated Story Corpus: Some Observations and Issues
    13 years 11 months ago
    Constructing an Annotated Story Corpus: Some Observations and Issues
    Download  www.lrec-conf.org
    This paper discusses our ongoing work on constructing an annotated corpus of children's stories for further studies on the linguistic, computational, and cognitive aspects of...
    Oi Yee Kwong
    claim paper
    Read More »
    IFIP12
    2007
    110views Information Technology» more  IFIP12 2007»
    Clustering Improves the Exploration of Graph Mining Results
    13 years 11 months ago
    Clustering Improves the Exploration of Graph Mining Results
    Download  www.liacs.nl
    Mining frequent subgraphs is an area of research where we have a given set of graphs, and where we search for (connected) subgraphs contained in many of these graphs. Each graph ca...
    Edgar H. de Graaf, Joost N. Kok, Walter A. Kosters
    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.