Sciweavers

    29143 search results - page 5708 / 5829
    » A Sortation System Model
    Sort
    View
    TIP
    2008
    90views more  TIP 2008»
    Synthetic Aperture Hitchhiker Imaging
    14 years 10 months ago
    Synthetic Aperture Hitchhiker Imaging
    Download  hibp.ecse.rpi.edu
    We introduce a novel synthetic-aperture imaging method for radar systems that rely on sources of opportunity. We consider receivers that fly along arbitrary, but known, flight traj...
    Can Evren Yarman, Birsen Yazici
    claim paper
    Read More »
    TISSEC
    2008
    202views more  TISSEC 2008»
    A Framework for Identifying Compromised Nodes in Wireless Sensor Networks
    14 years 10 months ago
    A Framework for Identifying Compromised Nodes in Wireless Sensor Networks
    Download  discovery.csc.ncsu.edu
    compromised sensor nodes. The framework provides an appropriate abstraction of applicationspecific detection mechanisms and models the unique properties of sensor networks. Based o...
    Qing Zhang, Ting Yu, Peng Ning
    claim paper
    Read More »
    JACM
    2007
    85views more  JACM 2007»
    The rational numbers as an abstract data type
    14 years 10 months ago
    The rational numbers as an abstract data type
    Download  www-compsci.swan.ac.uk
    onal Numbers as an Abstract Data Type1 J A Bergstra2 University of Amsterdam, Informatics Institute, Kruislaan 403, 1098 SJ Amsterdam, The Netherlands J V Tucker3 Department of Com...
    Jan A. Bergstra, J. V. Tucker
    claim paper
    Read More »
    JAIR
    2007
    141views more  JAIR 2007»
    Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
    14 years 10 months ago
    Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
    Download  www.aaai.org
    Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
    Alex S. Fukunaga, Richard E. Korf
    claim paper
    Read More »
    TIT
    2008
    102views more  TIT 2008»
    On Low-Complexity Maximum-Likelihood Decoding of Convolutional Codes
    14 years 10 months ago
    On Low-Complexity Maximum-Likelihood Decoding of Convolutional Codes
    Download  www.engr.colostate.edu
    Abstract--This letter considers the average complexity of maximum-likelihood (ML) decoding of convolutional codes. ML decoding can be modeled as finding the most probable path take...
    Jie Luo
    claim paper
    Read More »
    « Prev « First page 5708 / 5829 Last » Next »
    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.