ページ名 |
トップページ
|
メニュー
|
右メニュー
|
論文一覧
|
Hartigan's Method: k-means Clustering without Voronoi
|
Efficient Influence Maximization in Social Networks
|
IRIE: Scalable and Robust Influence Maximization in Social Networks
|
Simulated Annealing Based Influence Maximization in Social Networks
|
Scalable Influence Maximization for Prevalent Viral Marketing in Large-Scale ...
|
StaticGreedy: Solving the Scalability-Accuracy Dilemma in Influence Maximization
|
Memory Efficient Minimum Substring Partitioning
|
iRoad: A Framework For Scalable Predictive Query Processing On Road Networks
|
Streaming k-means approximation
|
StreamKM++: A Clustering Algorithm for Data Streams
|
Fast and Accurate k-means For Large Datasets
|
A Local Search Approximation Algorithm for k-Means Clustering
|
Streaming k-means on Well-Clusterable Data
|
k-means++: The Advantages of Careful Seeding
|
Fast Approximate Nearest-Neighbor Search with k-Nearest Neighbor Graph
|
Top-K Nearest Keyword Search on Large Graphs
|
Estimating Clustering Coefficients and Size of Social Networks via Random Walk
|
Streaming Graph Partitioning for Large Distributed Graphs
|
The Role of Social Networks in Information Diffusion
|
Fast Approximation Algorithms for the Diameter and Radius of Sparse Graphs
|
Keyword-aware Optimal Route Search
|
Efficiently Computing k-Edge Connected Components via Graph Decomposition
|
Denser than the Densest Subgraph: Extracting Optimal Quasi-Cliques with ...
|
Dynamic social networks promote cooperation in experiments with humans
|
Spectral Analysis of Communication Networks Using Dirichlet Eigenvalues
|
Accelerated k-means with adaptive distance bounds
|
Making k-means even faster
|
Using the Triangle Inequality to Accelerate k-Means
|
Hartigan's K-Means Versus Lloyd's K-Means - Is It Time for a Change?
|
Information Diffusion and External Influence in Networks
|
Analyzing Spammer's Social Networks for Fun and Profit
|
Massive Graph Triangulation
|
TurboISO: Towards Ultrafast and Robust Subgraph Isomorphism Search in Large ...
|
The Network Origins of Aggregate Fluctuations
|
Piggybacking on Social Networks
|
I/O Efficient: Computing SCCs in Massive Graphs
|
Human Wayfinding in Information Networks
|
TF-Label: a Topological-Folding Labeling Scheme for Reachability Querying in ...
|
On Approximation of Real-World Influence Spread
|
Scalable and Parallelizable Processing of Influence Maximization for ...
|
Wherefore Art Thou R3579X? Anonymized Social Networks, Hidden Patterns, and ...
|
Subgraph Frequencies: Mapping the Empirical and Extremal Geography of Large ...
|
Limiting the Spread of Misinformation in Social Networks
|
Scalable Influence Maximization in Social Networks under the Linear ...
|
Sampling Node Pairs Over Large Graphs
|
PageRank on an Evolving Graph
|
Computing global structural balance in large-scale signed social networks
|
Vertex Neighborhoods, Low Conductance Cuts, and Good Seeds for Local ...
|
Inferring Networks of Diffusion and Influence
|
The Price of Stability for Undirected Broadcast Network Design with Fair ...
|
Learning Sums of Independent Integer Random Variables
|
OSNAP: Faster numerical linear algebra algorithms via sparser subspace ...
|
Efficient Accelerated Coordinate Descent Methods and Faster Algorithms for ...
|
Algebraic Algorithms for b-Matching, Shortest Undirected Paths, and f-Factors
|
Improved approximation for 3-dimensional matching via bounded pathwidth ...
|
Independent Set, Induced Matching, and Pricing: Connections and Tight ...
|
Approximating Minimum-Cost k-Node Connected Subgraphs via Independence-Free ...
|
An LMP O(log n)-Approximation Algorithm for Node Weighted Prize Collecting ...
|
Online Node-weighted Steiner Forest and Extensions via Disk Paintings
|
Approximating Bin Packing within O(log OPT*loglog OPT) bins
|
Strong Backdoors to Bounded Treewidth SAT
|
Simpath: An Efficient Algorithm for Influence Maximization under the Linear ...
|
Maximizing Social Influence in Nearly Optimal Time
|
Personalized Influence Maximization on Social Networks
|
Probabilistic Solutions of Influence Propagation on Networks
|
gSketch: On Query Estimation in Graph Streams
|
Scalable Maximum Clique Computation Using MapReduce
|
Streaming Algorithms for k-core Decomposition
|
Fast Single-Pair SimRank Computation
|
Maximizing Submodular Set Function with Connectivity Constraint: Theory and ...
|
Sensitivity of Diffusion Dynamics to Network Uncertainty
|
Redundancy-Aware Maximal Cliques
|
Random-walk domination in large graphs: problem definitions and fast solutions
|
Online Search of Overlapping Communities
|
First Passage Time for Random Walks in Heterogeneous Networks
|
A Graph Minor Perspective to Network Coding: Connecting Algebraic Coding ...
|
More is Simpler: Effectively and Efficiently Assessing Node Pair ...
|
Spectral Rotation versus K-Means in Spectral Clustering
|
Exacting Social Events for Tweets Using a Factor Graph
|
Nonnegative Spectral Clustering with Discriminative Regularization
|
A Data-Based Approach to Social Influence Maximization
|
A Fast and Practical Bit-Vector Algorithm for the Longest Common Subsequence ...
|
Towards Context-Aware Search by Learning A Very Large Variable Length Hidden ...
|
TwitterRank: Finding Topic-sensitive Influential Twitterers
|
The query-flow graph: model and applications
|
Scalable Similarity Estimation in Social Networks: Closeness, Node Labels, ...
|
Adaptation and Optimization of Biological Transport Networks
|
Estimating Sizes of Social Networks via Biased Sampling
|
Shortest Path Computation on Air Indexes
|
Counting Triangles in Large Graphs using Randomized Matrix Trace Estimation
|
Efficiently Anonymizing Social Networks with Reachability Preservation
|
How to Partition a Billion-Node Graph
|
Random-walk Domination in Large Graphs
|
Faster Random Walks By Rewiring Online Social Networks On-The-Fly
|
Sampling Community Structure
|
2.5K-Graphs: from Sampling to Generation
|