Sciweavers

    IM
    2007
    168views Computer Networks» more  IM 2007»
    Cluster Generation and Labeling for Web Snippets: A Fast, Accurate Hierarchical Solution
    14 years 6 days 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 »
    IM
    2007
    131views Computer Networks» more  IM 2007»
    PageRank of Scale-Free Growing Networks
    14 years 6 days ago
    PageRank of Scale-Free Growing Networks
    Download  www.bionets.eu
    PageRank is one of the principle criteria according to which Google ranks Web pages. PageRank can be interpreted as a frequency of Web page visits by a random surfer and thus it r...
    Konstantin Avrachenkov, Dmitri Lebedev
    claim paper
    Read More »
    IM
    2007
    143views Computer Networks» more  IM 2007»
    Deterministic Models of Software Aging and Optimal Rejuvenation Schedules
    14 years 6 days ago
    Deterministic Models of Software Aging and Optimal Rejuvenation Schedules
    Download  www.coregrid.net
    Artur Andrzejak, Luís Moura Silva
    claim paper
    Read More »
    IM
    2007
    110views Computer Networks» more  IM 2007»
    Growing Protean Graphs
    14 years 10 days ago
    Growing Protean Graphs
    Download  www.math.uwaterloo.ca
    Abstract. The web may be viewed as a graph each of whose vertices corresponds to a static HTML web page, and each of whose edges corresponds to a hyperlink from one web page to ano...
    Pawel Pralat, Nicholas C. Wormald
    claim paper
    Read More »
    IM
    2007
    121views Computer Networks» more  IM 2007»
    Using the Power of Two Choices to Improve Bloom Filters
    14 years 10 days ago
    Using the Power of Two Choices to Improve Bloom Filters
    Download  www.eecs.harvard.edu
    We consider the combination of two ideas from the hashing literature: the power of two choices and Bloom filters. Specifically, we show via simulations that, in comparison with a...
    Steven S. Lumetta, Michael Mitzenmacher
    claim paper
    Read More »
    IM
    2007
    94views Computer Networks» more  IM 2007»
    Real Number Labelings for Paths and Cycles
    14 years 10 days ago
    Real Number Labelings for Paths and Cycles
    Download  www.math.sc.edu
    The problem of radio channel assignments with multiple levels of interference depending on distance can be modeled using graph theory. The authors previously introduced a model of...
    Jerrold R. Griggs, Xiaohua Teresa Jin
    claim paper
    Read More »
    IM
    2007
    127views Computer Networks» more  IM 2007»
    Using PageRank to Locally Partition a Graph
    14 years 10 days ago
    Using PageRank to Locally Partition a Graph
    Download  www.math.ucsd.edu
    A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
    Reid Andersen, Fan R. K. Chung, Kevin J. Lang
    claim paper
    Read More »
    IM
    2007
    119views Computer Networks» more  IM 2007»
    Expansion and Lack Thereof in Randomly Perturbed Graphs
    14 years 10 days ago
    Expansion and Lack Thereof in Randomly Perturbed Graphs
    Download  www.math.cmu.edu
    Abraham D. Flaxman
    claim paper
    Read More »
    IM
    2007
    166views Computer Networks» more  IM 2007»
    In-Degree and PageRank: Why Do They Follow Similar Power Laws?
    14 years 10 days ago
    In-Degree and PageRank: Why Do They Follow Similar Power Laws?
    Download  wwwhome.math.utwente.nl
    PageRank is a popularity measure designed by Google to rank Web pages. Experiments confirm that PageRank values obey a power law with the same exponent as In-Degree values. This ...
    Nelly Litvak, Werner R. W. Scheinhardt, Yana Volko...
    claim paper
    Read More »
    IM
    2007
    125views Computer Networks» more  IM 2007»
    Pursuit-Evasion in Models of Complex Networks
    14 years 10 days ago
    Pursuit-Evasion in Models of Complex Networks
    Download  www.math.ryerson.ca
    Vertex pursuit games, such as the game of Cops and Robbers, are a simplified model for network security. In these games, cops try to capture a robber loose on the vertices of the ...
    Anthony Bonato, Pawel Pralat, Changping Wang
    claim paper
    Read More »
    123456789next ›last »
    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.