| Insight into traffic security: A correlation discovery of urban spatial features and traffic flow patterns | 0 | 0.34 | 2021 |
| Narrowing the speedup factor gap of partitioned EDF | 0 | 0.34 | 2021 |
| Predict the Next Attack Location via An Attention-based Fused-SpatialTemporal LSTM. | 0 | 0.34 | 2020 |
| McDiarmid-Type Inequalities for Graph-Dependent Variables and Stability Bounds | 0 | 0.34 | 2019 |
| Impatient Online Matching. | 0 | 0.34 | 2018 |
| An Improved Speedup Factor for Sporadic Tasks with Constrained Deadlines Under Dynamic Priority Scheduling | 0 | 0.34 | 2018 |
| On the ERM Principle with Networked Data | 0 | 0.34 | 2018 |
| Memn:Multiple Vectors Embedding For Multi-Label Networks | 0 | 0.34 | 2018 |
| Variable Version Lovász Local Lemma: Beyond Shearer's Bound. | 0 | 0.34 | 2017 |
| Variable-Version Lovász Local Lemma: Beyond Shearer's Bound | 1 | 0.35 | 2017 |
| Partial Sorting Problem on Evolving Data. | 0 | 0.34 | 2017 |
| Community Detection: a Refined Axiomization and Beyond. | 0 | 0.34 | 2016 |
| Maximum bipartite matchings with low rank data: Locality and perturbation analysis. | 0 | 0.34 | 2016 |
| Communities in Preference Networks: Refined Axioms and Beyond | 0 | 0.34 | 2016 |
| Detecting Anomaly In Traffic Flow From Road Similarity Analysis | 1 | 0.37 | 2016 |
| How to Select the Top k Elements from Evolving Data? | 1 | 0.35 | 2015 |
| On the Near-Linear Correlation of the Eigenvalues Across BLOSUM Matrices. | 0 | 0.34 | 2015 |
| Delay analysis of two-hop network-coded delay-tolerant networks | 1 | 0.36 | 2015 |
| An adaptive spanning tree-based data collection scheme in wireless sensor networks | 2 | 0.50 | 2015 |
| How to select the largest k elements from evolving data? | 0 | 0.34 | 2014 |
| Perturbation Analysis of Maximum-Weighted Bipartite Matchings with Low Rank Data. | 0 | 0.34 | 2013 |
| Analysis Of Block Delivery Delay In Network Coding-Based Delay Tolerant Networks | 0 | 0.34 | 2013 |
| PEARL: Probing Entity Aggregation in Real Life | 0 | 0.34 | 2011 |
| Investigating, Modeling, and Ranking Interface Complexity of Web Services on the World Wide Web | 1 | 0.36 | 2010 |
| Classifying rendezvous tasks of arbitrary dimension | 3 | 0.38 | 2009 |
| A Chemical Interpretation of GSML Programs. | 1 | 0.36 | 2008 |
| The Impossibility of Boosting Resilience of Fully-connected Services for Solving Set-consensus Tasks | 0 | 0.34 | 2008 |
| A Classification of Degenerate Loop Agreement | 0 | 0.34 | 2008 |
| Personal grid | 0 | 0.34 | 2007 |
| Revisiting the impossibility for boosting service resilience | 1 | 0.39 | 2007 |
| A framework for data management and transfer in grid environments | 0 | 0.34 | 2006 |
| Approaching Simple and Powerful Service-Computing | 0 | 0.34 | 2006 |
| Interaction Complexity - A Computational Complexity Measure for Service-Oriented Computing | 2 | 0.40 | 2005 |
| Classification of Service Discovery | 1 | 0.35 | 2004 |
| Community-Based Model and Access Control for Information Grid | 4 | 0.83 | 2003 |
