Sciweavers

    4781 search results - page 941 / 957
    » Online algorithms for network design
    Sort
    View
    IJFCS
    2006
    106views more  IJFCS 2006»
    A Timed Failure Equivalence Preserving Abstraction for Parametric Time-interval Automata
    13 years 8 months ago
    A Timed Failure Equivalence Preserving Abstraction for Parametric Time-interval Automata
    Download  www.sos.info.hiroshima-cu.ac.jp
    ion for Parametric Time-Interval Automata Akio Nakata, Tadaaki Tanimoto, Suguru Sasaki, Teruo Higashino Department of Information Networking, Graduate School of Information Science...
    Akio Nakata, Tadaaki Tanimoto, Suguru Sasaki, Teru...
    claim paper
    Read More »
    JSAC
    2008
    140views more  JSAC 2008»
    Optimality and Complexity of Pure Nash Equilibria in the Coverage Game
    13 years 8 months ago
    Optimality and Complexity of Pure Nash Equilibria in the Coverage Game
    Download  www.egr.uh.edu
    In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
    Xin Ai, Vikram Srinivasan, Chen-Khong Tham
    claim paper
    Read More »
    JSAC
    2007
    116views more  JSAC 2007»
    Outreach: peer-to-peer topology construction towards minimized server bandwidth costs
    13 years 8 months ago
    Outreach: peer-to-peer topology construction towards minimized server bandwidth costs
    Download  www.eecg.toronto.edu
    Abstract— On-demand and live multimedia streaming applications (such as Internet TV) are well known to utilize a significant amount of bandwidth from media streaming servers, es...
    Tara Small, Baochun Li, Ben Liang
    claim paper
    Read More »
    RSA
    2000
    170views more  RSA 2000»
    Delayed path coupling and generating random permutations
    13 years 8 months ago
    Delayed path coupling and generating random permutations
    Download  www.im.pwr.wroc.pl
    We analyze various stochastic processes for generating permutations almost uniformly at random in distributed and parallel systems. All our protocols are simple, elegant and are b...
    Artur Czumaj, Miroslaw Kutylowski
    claim paper
    Read More »
    IM
    2007
    168views Computer Networks» more  IM 2007»
    Cluster Generation and Labeling for Web Snippets: A Fast, Accurate Hierarchical Solution
    13 years 8 months ago
    Cluster Generation and Labeling for Web Snippets: A Fast, Accurate Hierarchical Solution
    Download  nmis.isti.cnr.it
    This paper describes Armil, a meta-search engine that groups the web snippets returned by auxiliary search engines into disjoint labeled clusters. The cluster labels generated by A...
    Filippo Geraci, Marco Pellegrini, Marco Maggini, F...
    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.