Sciweavers

    732 search results - page 121 / 147
    » Termination of Integer Linear Programs
    Sort
    View
    CCCG
    2010
    224views Computational Geometry» more  CCCG 2010»
    Approximating the independent domatic partition problem in random geometric graphs - an experimental study
    13 years 9 months ago
    Approximating the independent domatic partition problem in random geometric graphs - an experimental study
    Download  www.cs.umanitoba.ca
    We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RG...
    Dhia Mahjoub, Angelika Leskovskaya, David W. Matul...
    claim paper
    Read More »
    EMNLP
    2008
    67views Natural Language Processing» more  EMNLP 2008»
    Jointly Combining Implicit Constraints Improves Temporal Ordering
    13 years 9 months ago
    Jointly Combining Implicit Constraints Improves Temporal Ordering
    Download  nlp.stanford.edu
    Previous work on ordering events in text has typically focused on local pairwise decisions, ignoring globally inconsistent labels. However, temporal ordering is the type of domain...
    Nathanael Chambers, Daniel Jurafsky
    claim paper
    Read More »
    NETWORKING
    2007
    136views Computer Networks» more  NETWORKING 2007»
    Optimal Topology Design for Overlay Networks
    13 years 9 months ago
    Optimal Topology Design for Overlay Networks
    Download  www.eece.ksu.edu
    Abstract. The topology creation is one of the most important step for the design of an overlay network. Traffic characteristic and volume, and behavior of nodes which can be sel...
    Mina Kamel, Caterina M. Scoglio, Todd Easton
    claim paper
    Read More »
    ICWN
    2004
    163views Wireless Networks» more  ICWN 2004»
    Efficient Minimum-Cost Bandwidth-Constrained Routing in Wireless Sensor Networks
    13 years 9 months ago
    Efficient Minimum-Cost Bandwidth-Constrained Routing in Wireless Sensor Networks
    Download  www.utdallas.edu
    A critical issue in the design of routing protocols for wireless sensor networks is the efficient utilization of resources such as scarce bandwidth and limited energy supply. Many ...
    Maulin Patel, R. Chandrasekaran, S. Venkatesan
    claim paper
    Read More »
    WSC
    2004
    133views Modeling And Simulation» more  WSC 2004»
    Computer Automated Multi-Paradigm Modelling for Analysis and Design of Traffic Networks
    13 years 9 months ago
    Computer Automated Multi-Paradigm Modelling for Analysis and Design of Traffic Networks
    Download  www.informs-sim.org
    Computer Automated Multi-Paradigm Modelling (CAMPaM) is an enabler for domain-specific analysis and design. Traffic, a new untimed visual formalism for vehicle traffic networks, i...
    Hans Vangheluwe, Juan de Lara
    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.