Ning Ruan

Orcid: 0000-0001-8285-9430

According to our database1, Ning Ruan authored at least 26 papers between 2006 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
An Efficient Conversational Smart Compose System.
Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics: System Demonstrations, 2023

2020
Comprehensive Criteria-Based Generalized Steganalysis Feature Selection Method.
IEEE Access, 2020

2017
相关集的数据关联描述及实例讨论 (Description of Data Association Occurring in Related Sets and Specific Example).
计算机科学, 2017

2015
Global solutions to fractional programming problem with ratio of nonconvex functions.
Appl. Math. Comput., 2015

2014
Global optimal solutions to general sensor network localization problem.
Perform. Evaluation, 2014

2013
Hub-Accelerator: Fast and Exact Shortest Path Computation in Large Social Networks
CoRR, 2013

An Interesting Cryptography Study Based on Knapsack Problem.
Proceedings of the 15th International Conference on Computer Modelling and Simulation, 2013

2012
Global Optimal Solution to Discrete Value Selection Problem with Inequality Constraints
CoRR, 2012

Network Backbone Discovery Using Edge Clustering
CoRR, 2012

A highway-centric labeling approach for answering distance queries on large sparse graphs.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2012

SCARAB: scaling reachability computation on large graphs.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2012

Canonical Duality Theory and Algorithm for Solving Challenging Problems in Network Optimisation.
Proceedings of the Neural Information Processing - 19th International Conference, 2012

2011
Path-tree: An efficient reachability indexing scheme for large directed graphs.
ACM Trans. Database Syst., 2011

Distance Preserving Graph Simplification.
Proceedings of the 11th IEEE International Conference on Data Mining, 2011

2010
A Survey of Algorithms for Dense Subgraph Discovery.
Proceedings of the Managing and Mining Graph Data, 2010

Solutions to quadratic minimization problems with box and integer constraints.
J. Glob. Optim., 2010

Canonical dual least square method for solving general nonlinear systems of quadratic equations.
Comput. Optim. Appl., 2010

Computing label-constraint reachability in graph databases.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2010

2009
Solutions and optimality criteria for nonconvex constrained global optimization problems with connections between canonical and Lagrangian duality.
J. Glob. Optim., 2009

3-HOP: a high-compression indexing scheme for reachability query.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2009

A Sparsification Approach for Temporal Graphical Model Decomposition.
Proceedings of the ICDM 2009, 2009

2008
Solutions and optimality criteria for nonconvex quadratic-exponential minimization problem.
Math. Methods Oper. Res., 2008

Efficiently answering reachability queries on very large directed graphs.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2008

Effective and efficient itemset pattern summarization: regression-based approaches.
Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2008

2006
An efficient algorithm for nonlinear integer programming problems arising in series-parallel reliability systems.
Optim. Methods Softw., 2006

An exact algorithm for cost minimization in series reliability systems with multiple component choices.
Appl. Math. Comput., 2006


  Loading...