Sciweavers

    920 search results - page 166 / 184
    » Computing the Frequency of Partial Orders
    Sort
    View
    SIGMOD
    2008
    ACM
    142views Database» more  SIGMOD 2008»
    Cost-based variable-length-gram selection for string collections to support approximate queries efficiently
    14 years 7 months ago
    Cost-based variable-length-gram selection for string collections to support approximate queries efficiently
    Download  www.db-infotech.cn
    Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
    Xiaochun Yang, Bin Wang, Chen Li
    claim paper
    Read More »
    TALG
    2008
    131views more  TALG 2008»
    Kinetic and dynamic data structures for closest pair and all nearest neighbors
    13 years 7 months ago
    Kinetic and dynamic data structures for closest pair and all nearest neighbors
    Download  www.math.tau.ac.il
    We present simple, fully dynamic and kinetic data structures, which are variants of a dynamic two-dimensional range tree, for maintaining the closest pair and all nearest neighbors...
    Pankaj K. Agarwal, Haim Kaplan, Micha Sharir
    claim paper
    Read More »
    CONEXT
    2009
    ACM
    203views Computer Networks» more  CONEXT 2009»
    ARES: an anti-jamming reinforcement system for 802.11 networks
    13 years 8 months ago
    ARES: an anti-jamming reinforcement system for 802.11 networks
    Download  www.cs.ucr.edu
    Dense, unmanaged 802.11 deployments tempt saboteurs into launching jamming attacks by injecting malicious interference. Nowadays, jammers can be portable devices that transmit int...
    Konstantinos Pelechrinis, Ioannis Broustis, Srikan...
    claim paper
    Read More »
    JPDC
    2006
    85views more  JPDC 2006»
    Provable algorithms for parallel generalized sweep scheduling
    13 years 7 months ago
    Provable algorithms for parallel generalized sweep scheduling
    Download  ndssl.vbi.vt.edu
    We present provably efficient parallel algorithms for sweep scheduling, which is a commonly used technique in Radiation Transport problems, and involves inverting an operator by i...
    V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Pa...
    claim paper
    Read More »
    CVPR
    2006
    IEEE
    422views Computer Vision» more  CVPR 2006»
    Robust Fragments-based Tracking using the Integral Histogram
    14 years 9 months ago
    Robust Fragments-based Tracking using the Integral Histogram
    Download  www.cs.technion.ac.il
    We present a novel algorithm (which we call "FragTrack") for tracking an object in a video sequence. The template object is represented by multiple image fragments or pa...
    Amit Adam, Ehud Rivlin, Ilan Shimshoni
    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.