Sciweavers

    3471 search results - page 201 / 695
    » Obstacle Numbers of Graphs
    Sort
    View
    SDM
    2010
    SIAM
    115views Data Mining» more  SDM 2010»
    Radius Plots for Mining Tera-byte Scale Graphs: Algorithms, Patterns, and Observations
    15 years 6 months ago
    Radius Plots for Mining Tera-byte Scale Graphs: Algorithms, Patterns, and Observations
    Download  www.cs.cmu.edu
    Given large, multi-million node graphs (e.g., FaceBook, web-crawls, etc.), how do they evolve over time? How are they connected? What are the central nodes and the outliers of the...
    U. Kang, Charalampos E. Tsourakakis, Ana Paula App...
    claim paper
    Read More »
    143
    Voted
    NIPS
    2007
    138views Information Technology» more  NIPS 2007»
    Local Algorithms for Approximate Inference in Minor-Excluded Graphs
    15 years 6 months ago
    Local Algorithms for Approximate Inference in Minor-Excluded Graphs
    Download  books.nips.cc
    We present a new local approximation algorithm for computing MAP and logpartition function for arbitrary exponential family distribution represented by a finite-valued pair-wise ...
    Kyomin Jung, Devavrat Shah
    claim paper
    Read More »
    138
    Voted
    GD
    2008
    Springer
    92views Computer Graphics» more  GD 2008»
    Visibility Representations of Four-Connected Plane Graphs with Near Optimal Heights
    15 years 6 months ago
    Visibility Representations of Four-Connected Plane Graphs with Near Optimal Heights
    Download  www.csie.ntu.edu.tw
    A visibility representation of a graph G is to represent the nodes of G with non-overlapping horizontal line segments such that the line segments representing any two distinct adja...
    Chieh-Yu Chen, Ya-Fei Hung, Hsueh-I Lu
    claim paper
    Read More »
    DC
    2010
    208views Internet Technology» more  DC 2010»
    An optimal maximal independent set algorithm for bounded-independence graphs
    15 years 5 months ago
    An optimal maximal independent set algorithm for bounded-independence graphs
    Download  dcg.ethz.ch
    We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...
    Johannes Schneider, Roger Wattenhofer
    claim paper
    Read More »
    151
    Voted
    JNSM
    2008
    93views more  JNSM 2008»
    Optimal IDS Sensor Placement and Alert Prioritization Using Attack Graphs
    15 years 5 months ago
    Optimal IDS Sensor Placement and Alert Prioritization Using Attack Graphs
    Download  csis.gmu.edu
    We optimally place intrusion detection system (IDS) sensors and prioritize IDS alerts using attack graph analysis. We begin by predicting all possible ways of penetrating a networ...
    Steven Noel, Sushil Jajodia
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.