| ページ名 |
|
One-shot learning by inverting a compositional causal process
(4576日前)
|
|
Similarity Component Analysis
(4576日前)
|
|
A Gang of Bandits
(4576日前)
|
|
DeViSE: A Deep Visual-Semantic Embedding Model
(4576日前)
|
|
On the Streaming Complexity of Computing Local Clustering Coefficients
(4576日前)
|
|
CELF++: Optimizing the Greedy Algorithm for Influence Maximization in Social ...
(4577日前)
|
|
CINEMA: Conformity-Aware Greedy Algorithm for Influence Maximization in ...
(4585日前)
|
|
Analyzing Spammer's Social Networks for Fun and Profit
(4585日前)
|
|
Modeling Information Diffusion in Implicit Networks
(4587日前)
|
|
Cost-effective Outbreak Detection in Networks
(4589日前)
|
|
Efficient algorithms for influence maximization in social networks
(4591日前)
|
|
Community-based Greedy Algorithm for Mining Top-K Influential Nodes in ...
(4592日前)
|
|
Outlier Detection in Graph Streams
(4593日前)
|
|
From Dango to Japanese Cakes: Query Reformulation Models and Patterns
(4598日前)
|
|
2.5K-Graphs: from Sampling to Generation
(4599日前)
|
|
Sampling Community Structure
(4599日前)
|
|
Faster Random Walks By Rewiring Online Social Networks On-The-Fly
(4601日前)
|
|
Random-walk Domination in Large Graphs
(4604日前)
|
|
How to Partition a Billion-Node Graph
(4604日前)
|
|
Counting Triangles in Large Graphs using Randomized Matrix Trace Estimation
(4612日前)
|
|
Shortest Path Computation on Air Indexes
(4614日前)
|
|
Estimating Sizes of Social Networks via Biased Sampling
(4615日前)
|
|
Scalable Similarity Estimation in Social Networks: Closeness, Node Labels, ...
(4618日前)
|
|
Adaptation and Optimization of Biological Transport Networks
(4619日前)
|
|
The query-flow graph: model and applications
(4619日前)
|
|
TwitterRank: Finding Topic-sensitive Influential Twitterers
(4620日前)
|
|
Towards Context-Aware Search by Learning A Very Large Variable Length Hidden ...
(4621日前)
|
|
A Fast and Practical Bit-Vector Algorithm for the Longest Common Subsequence ...
(4622日前)
|
|
Nonnegative Spectral Clustering with Discriminative Regularization
(4626日前)
|
|
Exacting Social Events for Tweets Using a Factor Graph
(4626日前)
|
|
Spectral Rotation versus K-Means in Spectral Clustering
(4629日前)
|
|
More is Simpler: Effectively and Efficiently Assessing Node Pair ...
(4632日前)
|
|
Online Search of Overlapping Communities
(4632日前)
|
|
A Graph Minor Perspective to Network Coding: Connecting Algebraic Coding ...
(4638日前)
|
|
First Passage Time for Random Walks in Heterogeneous Networks
(4639日前)
|
|
Maximizing Social Influence in Nearly Optimal Time
(4640日前)
|
|
Random-walk domination in large graphs: problem definitions and fast solutions
(4643日前)
|
|
Redundancy-Aware Maximal Cliques
(4644日前)
|
|
Sensitivity of Diffusion Dynamics to Network Uncertainty
(4644日前)
|
|
Maximizing Submodular Set Function with Connectivity Constraint: Theory and ...
(4646日前)
|
|
Fast Single-Pair SimRank Computation
(4647日前)
|
|
Streaming Algorithms for k-core Decomposition
(4648日前)
|
|
Scalable Maximum Clique Computation Using MapReduce
(4651日前)
|
|
gSketch: On Query Estimation in Graph Streams
(4655日前)
|
|
Probabilistic Solutions of Influence Propagation on Networks
(4656日前)
|
|
Personalized Influence Maximization on Social Networks
(4656日前)
|
|
StaticGreedy: Solving the Scalability-Accuracy Dilemma in Influence Maximization
(4656日前)
|
|
Strong Backdoors to Bounded Treewidth SAT
(4658日前)
|
|
Approximating Bin Packing within O(log OPT*loglog OPT) bins
(4658日前)
|
|
Online Node-weighted Steiner Forest and Extensions via Disk Paintings
(4658日前)
|
|
An LMP O(log n)-Approximation Algorithm for Node Weighted Prize Collecting ...
(4658日前)
|
|
Approximating Minimum-Cost k-Node Connected Subgraphs via Independence-Free ...
(4658日前)
|
|
Independent Set, Induced Matching, and Pricing: Connections and Tight ...
(4658日前)
|
|
Improved approximation for 3-dimensional matching via bounded pathwidth ...
(4658日前)
|
|
Algebraic Algorithms for b-Matching, Shortest Undirected Paths, and f-Factors
(4658日前)
|
|
Efficient Accelerated Coordinate Descent Methods and Faster Algorithms for ...
(4658日前)
|
|
OSNAP: Faster numerical linear algebra algorithms via sparser subspace ...
(4658日前)
|
|
Learning Sums of Independent Integer Random Variables
(4658日前)
|
|
The Price of Stability for Undirected Broadcast Network Design with Fair ...
(4658日前)
|
|
Inferring Networks of Diffusion and Influence
(4659日前)
|
|
Vertex Neighborhoods, Low Conductance Cuts, and Good Seeds for Local ...
(4660日前)
|
|
Computing global structural balance in large-scale signed social networks
(4661日前)
|
|
PageRank on an Evolving Graph
(4662日前)
|
|
Sampling Node Pairs Over Large Graphs
(4663日前)
|
|
Scalable Influence Maximization in Social Networks under the Linear ...
(4664日前)
|
|
Limiting the Spread of Misinformation in Social Networks
(4668日前)
|
|
Subgraph Frequencies: Mapping the Empirical and Extremal Geography of Large ...
(4668日前)
|
|
Wherefore Art Thou R3579X? Anonymized Social Networks, Hidden Patterns, and ...
(4669日前)
|
|
Scalable and Parallelizable Processing of Influence Maximization for ...
(4669日前)
|
|
On Approximation of Real-World Influence Spread
(4671日前)
|
|
TF-Label: a Topological-Folding Labeling Scheme for Reachability Querying in ...
(4672日前)
|
|
Human Wayfinding in Information Networks
(4673日前)
|
|
TurboISO: Towards Ultrafast and Robust Subgraph Isomorphism Search in Large ...
(4673日前)
|
|
Piggybacking on Social Networks
(4674日前)
|
|
Keyword-aware Optimal Route Search
(4674日前)
|
|
Top-K Nearest Keyword Search on Large Graphs
(4674日前)
|
|
The Role of Social Networks in Information Diffusion
(4674日前)
|
|
Spectral Analysis of Communication Networks Using Dirichlet Eigenvalues
(4674日前)
|
|
Memory Efficient Minimum Substring Partitioning
(4674日前)
|
|
Streaming Graph Partitioning for Large Distributed Graphs
(4674日前)
|
|
StreamKM++: A Clustering Algorithm for Data Streams
(4674日前)
|
|
Streaming k-means on Well-Clusterable Data
(4674日前)
|
|
Fast and Accurate k-means For Large Datasets
(4674日前)
|
|
Streaming k-means approximation
(4674日前)
|
|
I/O Efficient: Computing SCCs in Massive Graphs
(4674日前)
|
|
The Network Origins of Aggregate Fluctuations
(4675日前)
|
|
Massive Graph Triangulation
(4675日前)
|
|
Information Diffusion and External Influence in Networks
(4676日前)
|
|
Hartigan's Method: k-means Clustering without Voronoi
(4679日前)
|
|
Hartigan's K-Means Versus Lloyd's K-Means - Is It Time for a Change?
(4679日前)
|
|
Dynamic social networks promote cooperation in experiments with humans
(4679日前)
|
|
Making k-means even faster
(4679日前)
|
|
Using the Triangle Inequality to Accelerate k-Means
(4679日前)
|
|
Accelerated k-means with adaptive distance bounds
(4680日前)
|
|
Denser than the Densest Subgraph: Extracting Optimal Quasi-Cliques with ...
(4682日前)
|
|
Scalable Influence Maximization for Prevalent Viral Marketing in Large-Scale ...
(4682日前)
|
|
Efficiently Computing k-Edge Connected Components via Graph Decomposition
(4682日前)
|
|
Fast Approximation Algorithms for the Diameter and Radius of Sparse Graphs
(4682日前)
|
|
Estimating Clustering Coefficients and Size of Social Networks via Random Walk
(4683日前)
|
|
iRoad: A Framework For Scalable Predictive Query Processing On Road Networks
(4684日前)
|
