todo314 @ ウィキ
todo314 @ ウィキ

ページ一覧 (2)

ページ一覧 (更新順) 2ページ目

人気順に表示 | 更新順に表示 | 作成日時(古い順) に表示 | 作成日時(新しい順) に表示 | ページ名順に表示 | wiki内検索

計 408 ページ / 101 から 200 を表示

ページ名
Top-k Reliability Search on Uncertain Graphs (2715日前)
Polynomial-Time Algorithm for Finding Densest Subgraphs in Uncertain Graphs (2752日前)
Fast Discovery of Reliable Subnetworks (2753日前)
Efficient Discovery of Frequent Subgraph Patterns in Uncertain Graph Databases (2757日前)
Trial and Error in Influential Social Networks (2758日前)
Minimum-Cost Information Dissemination in Social Networks (2841日前)
Non-monotone Adaptive Submodular Maximization (2890日前)
Fast Robustness Estimation in Large Social Graphs: Communities and Anomaly ... (2910日前)
Gelling, and Melting, Large Graphs by Edge Manipulation (2910日前)
Triangle-Based Representative Possible Worlds of Uncertain Graphs (2912日前)
Computing Top-k Closeness Centrality Faster in Unweighted Graphs (2919日前)
Discovering Frequent Subgraphs over Uncertain Graph Databases under ... (2930日前)
Scalable Influence Estimation in Continuous-Time Diffusion Networks (2989日前)
On Influential Nodes Tracking in Dynamic Social Networks (2997日前)
Catching the head, tail, and everything in between: a streaming algorithm ... (2997日前)
Frequent Subgraph Pattern Mining on Uncertain Graph Data (3013日前)
The Pursuit of a Good Possible World: Extracting Representative Instances of ... (3013日前)
Parameterized Algorithms (3035日前)
Reliable Clustering on Uncertain Graphs (3036日前)
A practical bounding algorithm for computing two-terminal reliability based ... (3048日前)
Fast Discovery of Reliable k-terminal Subgraphs (3049日前)
Locally Densest Subgraph Discovery (3057日前)
Finding Top-k Maximal Cliques in an Uncertain Graph (3058日前)
Distance Constraint Reachability Computation in Uncertain Graphs (3059日前)
Top-k Reliable Edge Colors in Uncertain Graphs (3060日前)
k-Nearest Neighbors in Uncertain Graphs (3060日前)
Discovering Highly Reliable Subgraphs in Uncertain Graphs (3078日前)
The Most Reliable Subgraph Problem (3078日前)
Word Alignment via Submodular Maximization over Matroids (3081日前)
Recommendations to Boost Content Spread in Social Networks (3089日前)
Scalable K-Means++ (3089日前)
COMMIT: A Scalable Approach to Mining Communication Motifs from Dynamic Networks (3092日前)
Streaming Submodular Maximization: Massive Data Summarization on the Fly (3104日前)
Influence maximization in complex networks through optimal percolation (3106日前)
Real-time Topic-aware Influence Maximization Using Preprocessing (3123日前)
Influence Maximization in Big Networks: An Incremental Algorithm for ... (3128日前)
Online Influence Maximization (3128日前)
Fast Influence-based Coarsening for Large Networks (3157日前)
Reciprocity in Social Networks with Capacity Constraints (3172日前)
Efficient Algorithms for Public-Private Social Networks (3176日前)
Influence at Scale: Distributed Computation of Complex Contagion in Networks (3177日前)
Tracking the Random Surfer: Empirically Measured Teleportation Parameters in ... (3196日前)
Efficient influence spread estimation for influence maximization under the ... (3210日前)
Dynamic Influence Maximization Under Increasing Returns to Scale (3210日前)
Maximising the Quality of Influence (3213日前)
Diversified Social Influence Maximization (3213日前)
IMRank: Influence Maximization via Finding Self-Consistent Ranking (3214日前)
Minimizing Seed Set for Viral Marketing (3220日前)
Efficiently Anonymizing Social Networks with Reachability Preservation (3221日前)
Make It or Break It: Manipulating Robustness in Large Networks (3224日前)
Where Graph Topology Matters: The Robust Subgraph Problem (3224日前)
Minimum-Risk Maximum Clique Problem (3226日前)
Minimum Spanning Trees in Temporal Graphs (3232日前)
Suggesting Ghost Edges for a Smaller World (3234日前)
Identifying Converging Pairs of Nodes on a Budget (3234日前)
Two Weighting Local Search for Minimum Vertex Cover (3235日前)
Two New Local Search Strategies for Minimum Vertex Cover (3235日前)
EWLS: A New Local Search for Minimum Vertex Cover (3235日前)
Selecting Shortcuts for a Smaller World (3245日前)
Path Sampling: A Fast and Provable Method for Estimating 4-Vertex Subgraph ... (3270日前)
Overlapping correlation clustering (3270日前)
Chromatic Correlation Clustering (3270日前)
Correlation Clustering in MapReduce (3270日前)
On minimizing budget and time in influence propagation over social networks (3270日前)
Simpath: An Efficient Algorithm for Influence Maximization under the Linear ... (3306日前)
Lazy Walks Versus Walks with Backstep: Flavor of PageRank (3311日前)
Minimizing the expected complete influence time of a social network (3317日前)
Super mediator - A new centrality measure of node importance for information ... (3318日前)
Balanced Graph Edge Partition (3330日前)
Privacy Preserving Estimation of Social Influence (3340日前)
RandomSurfer with Back Step (3346日前)
Stochastic Models for Tabbed Browsing (3351日前)
The Power of Random Neighbors in Social Networks (3354日前)
On Integrating Network and Community Discovery (3354日前)
Negative Link Prediction in Social Media (3354日前)
Quick Detection of High-degree Entities in Large Directed Networks (3400日前)
From Machu_Picchu to rafting the urubamba river: Anticipating information ... (3409日前)
A General Framework of Hybrid Graph Sampling for Complex Network Analysis (3409日前)
Influence Spread in Large-Scale Social Networks - A Belief Propagation Approach (3428日前)
Influential Nodes Selection: A Data Reconstruction Perspective (3428日前)
Spectral Redemption: Clustering Sparse Networks (3428日前)
BackRank: an Alternative for PageRank? (3431日前)
The Effect of the Back Button in a Random Walk: Application for PageRank (3431日前)
Querying K-Truss Community in Large and Dynamic Graph (3433日前)
Enhanced Flow in Small-World Networks (3433日前)
Fast Incremental and Personalized PageRank (3433日前)
Link Evolution: Analysis and Algorithms (3433日前)
A scaling law for random walks on networks (3433日前)
Pushing the Envelope in Graph Compression (3442日前)
Heat Kernel Based Community Detection (3449日前)
A user-centric model of voting intention from Social Media (3476日前)
ICWSM - A Great Catchy Name: Semi-Supervised Recognition of Sarcastic ... (3476日前)
Minimizing Seed Set Selection with Probabilistic Coverage Guarantee in a ... (3480日前)
On k-Path Covers and their Applications (3489日前)
Lazier Than Lazy Greedy (3494日前)
Theory of Cooperation in Complex Social Networks (3495日前)
On k-skip Shortest Paths (3497日前)
The matching polytope has exponential extension complexity (3497日前)
Approximation Algorithms for Regret-Bounded Vehicle Routing and Applications ... (3497日前)
Zig-zag Sort: A Simple Deterministic Data-Oblivious Sorting Algorithm ... (3497日前)

計 408 ページ