todo314 @ ウィキ
todo314 @ ウィキ

ページ一覧

ページ一覧 (ページ名順)

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

計 408 ページ / 1 から 100 を表示

ページ名
2.5K-Graphs: from Sampling to Generation
4chan and /b/: An Analysis of Anonymity and Ephemerality in a Large Online ...
A Data-Based Approach to Social Influence Maximization
A Dual-tree Algorithm for Fast k-means Clustering with Large k
A Fast and Practical Bit-Vector Algorithm for the Longest Common Subsequence ...
A Fast and Provable Method for Estimating Clique Counts Using Turan's Theorem
A Gang of Bandits
A General Framework of Hybrid Graph Sampling for Complex Network Analysis
A Graph Minor Perspective to Network Coding: Connecting Algebraic Coding ...
A Local Search Approximation Algorithm for k-Means Clustering
A Note on Maximizing the Spread of Influence in Social Networks
A Novel and Model Independent Approach for Efficient Influence Maximization ...
A practical bounding algorithm for computing two-terminal reliability based ...
A scaling law for random walks on networks
A Structural Smoothing Framework For Robust Graph-Comparison
A Submodular Framework for Graph Comparison
A user-centric model of voting intention from Social Media
Accelerated k-means with adaptive distance bounds
Accelerating Graph Adjacency Matrix Multiplications with Adjacency Forest
Adaptation and Optimization of Biological Transport Networks
Algebraic Algorithms for b-Matching, Shortest Undirected Paths, and f-Factors
An Application of Boosting to Graph Classification
An LMP O(log n)-Approximation Algorithm for Node Weighted Prize Collecting ...
An Upper Bound based Greedy Algorithm for Mining Top-k Influential Nodes in ...
Analyzing Spammer's Social Networks for Fun and Profit
Anytime Influence Bounds and the Explosive Behavior of Continuous-Time ...
Approximate Bayesian Image Interpretation using Generative Probabilistic ...
Approximate Convex Decomposition Based Localization in Wireless Sensor Networks
Approximate Distance Oracle with Constant Query Time
Approximating Bin Packing within O(log OPT*loglog OPT) bins
Approximating Minimum-Cost k-Node Connected Subgraphs via Independence-Free ...
Approximating the Spectrum of a Graph
Approximation Algorithms for Regret-Bounded Vehicle Routing and Applications ...
ASIM: A Scalable Algorithm for Influence Maximization under the Independent ...
Assessing Attack Vulnerability in Networks with Uncertainty
BackRank: an Alternative for PageRank?
Balanced Graph Edge Partition
Blocking Links to Minimize Contamination Spread in a Social Network
BMC: An Efficient Method to Evaluate Probabilistic Reachability Queries
Budgeted stream-based active learning via adaptive submodular maximization
Catching the head, tail, and everything in between: a streaming algorithm ...
CELF++: Optimizing the Greedy Algorithm for Influence Maximization in Social ...
Chromatic Correlation Clustering
CINEMA: Conformity-Aware Greedy Algorithm for Influence Maximization in ...
Clustering Large Probabilistic Graphs
Co-clustering documents and words using Bipartite Spectral Graph Partitioning
COMMIT: A Scalable Approach to Mining Communication Motifs from Dynamic Networks
Community-based Greedy Algorithm for Mining Top-K Influential Nodes in ...
Competitive Influence Maximization in Social Networks
Computing A Near-Maximum Independent Set in Linear Time by Reducing-Peeling
Computing and maximizing influence in linear threshold and triggering models
Computing global structural balance in large-scale signed social networks
Computing Top-k Closeness Centrality Faster in Unweighted Graphs
Control Profiles of Complex Networks
Correlation Clustering in MapReduce
Cost-aware Targeted Viral Marketing in Billion-scale Networks
Cost-effective Outbreak Detection in Networks
Counting Triangles in Large Graphs using Randomized Matrix Trace Estimation
Crowdsourcing Algorithms for Entity Resolution
DAG Reduction: Fast Answering Reachability Queries
Debunking the Myths of Influence Maximization: An In-Depth Benchmarking Study
Delineating Social Network Data Anonymization via Random Edge Perturbation
Denser than the Densest Subgraph: Extracting Optimal Quasi-Cliques with ...
DeViSE: A Deep Visual-Semantic Embedding Model
Diffusion Centrality in Social Networks
Discovering Frequent Subgraphs over Uncertain Graph Databases under ...
Discovering Highly Reliable Subgraphs in Uncertain Graphs
Distance Constraint Reachability Computation in Uncertain Graphs
Distributed Set Reachability
Diversified Social Influence Maximization
Dynamic and Static Influence Models on Starbucks Networks
Dynamic Density Based Clustering
Dynamic Influence Maximization Under Increasing Returns to Scale
Dynamic PageRank using Evolving Teleportation
Dynamic Social Influence Analysis through Time-dependent Factor Graphs
Dynamic social networks promote cooperation in experiments with humans
Efficient Accelerated Coordinate Descent Methods and Faster Algorithms for ...
Efficient Ad-hoc Search for Personalized PageRank
Efficient algorithms for influence maximization in social networks
Efficient Algorithms for Public-Private Social Networks
Efficient and Accurate Query Evaluation on Uncertain Graphs via Recursive ...
Efficient Discovery of Frequent Subgraph Patterns in Uncertain Graph Databases
Efficient Estimation of Influence Functions for SIS Model on Social Networks
Efficient Influence Maximization in Social Networks
Efficient influence spread estimation for influence maximization under the ...
Efficient Label Propagation
Efficient Location-Aware Influence Maximization
Efficient Personalized PageRank with Accuracy Assurance
Efficient Subgraph Search over Large Uncertain Graphs
Efficiently Anonymizing Social Networks with Reachability Preservation
Efficiently Computing k-Edge Connected Components via Graph Decomposition
Enhanced Flow in Small-World Networks
Estimating Clustering Coefficients and Size of Social Networks via Random Walk
Estimating Sizes of Social Networks via Biased Sampling
Evaluating Multi-Way Joins over Discounted Hitting Time
EWLS: A New Local Search for Minimum Vertex Cover
Exact Computation of Influence Spread by Binary Decision Diagrams
Exacting Social Events for Tweets Using a Factor Graph
Extracting Analyzing and Visualizing Triangle K-Core Motifs within Networks
Extracting Influential Nodes for Information Diffusion on a Social Network

計 408 ページ