Sciweavers

    866 search results - page 53 / 174
    » On Dynamic Shortest Paths Problems
    Sort
    View
    IEEEMSP
    2002
    IEEE
    94views Multimedia» more  IEEEMSP 2002»
    An optimal shape encoding scheme using skeleton decomposition
    14 years 17 days ago
    An optimal shape encoding scheme using skeleton decomposition
    Download  www.eecs.northwestern.edu
    —This paper presents an operational rate-distortion (ORD) optimal approach for skeleton-based boundary encoding. The boundary information is first decomposed into skeleton and di...
    Haohong Wang, Guido M. Schuster, Aggelos K. Katsag...
    claim paper
    Read More »
    SIAMCOMP
    2000
    125views more  SIAMCOMP 2000»
    Approximating the Stretch Factor of Euclidean Graphs
    13 years 7 months ago
    Approximating the Stretch Factor of Euclidean Graphs
    Download  users.cis.fiu.edu
    There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
    Giri Narasimhan, Michiel H. M. Smid
    claim paper
    Read More »
    JPDC
    2006
    187views more  JPDC 2006»
    Maximum lifetime data sensing and extraction in energy constrained networked sensor systems
    13 years 7 months ago
    Maximum lifetime data sensing and extraction in energy constrained networked sensor systems
    Download  halcyon.usc.edu
    We focus on data gathering problems in energy constrained networked sensor systems. The system operates in rounds where a subset of the sensors generate a certain number of data p...
    Bo Hong, Viktor K. Prasanna
    claim paper
    Read More »
    TON
    2008
    99views more  TON 2008»
    On the computational complexity and effectiveness of N-hub shortest-path routing
    13 years 7 months ago
    On the computational complexity and effectiveness of N-hub shortest-path routing
    Download  www.ieee-infocom.org
    Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...
    Reuven Cohen, Gabi Nakibly
    claim paper
    Read More »
    ICANNGA
    2007
    Springer
    133views Algorithms» more  ICANNGA 2007»
    Finding the Optimal Path in 3D Spaces Using EDAs - The Wireless Sensor Networks Scenario
    14 years 1 months ago
    Finding the Optimal Path in 3D Spaces Using EDAs - The Wireless Sensor Networks Scenario
    Download  boyuan.global-optimization.com
    Abstract. In wireless sensor networks where sensors are geographically deployed in 3D spaces, a mobile robot is required to travel to each sensor in order to download the data. The...
    Bo Yuan, Maria E. Orlowska, Shazia Wasim Sadiq
    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.