Xiaoming Sun

According to our database1, Xiaoming Sun authored at least 143 papers between 2000 and 2019.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
A tighter relation between sensitivity complexity and certificate complexity.
Theor. Comput. Sci., 2019

A Quantum-inspired Classical Algorithm for Separable Non-negative Matrix Factorization.
CoRR, 2019

Optimal Space-Depth Trade-Off of CNOT Circuits in Quantum Logic Synthesis.
CoRR, 2019

Cake Cutting on Graphs: A Discrete and Bounded Proportional Protocol.
CoRR, 2019

Querying a Matrix through Matrix-Vector Products.
CoRR, 2019

Dynamic MCMC Sampling.
CoRR, 2019

From independent sets and vertex colorings to isotropic spaces and isotropic decompositions.
CoRR, 2019

Cumulative activation in social networks.
SCIENCE CHINA Information Sciences, 2019

The Complexity of Optimization on Grids.
Algorithmica, 2019

Quantum Lovász local lemma: Shearer's bound is tight.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

A Quantum-inspired Classical Algorithm for Separable Non-negative Matrix Factorization.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Querying a Matrix Through Matrix-Vector Products.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

The One-Round Multi-player Discrete Voronoi Game on Grids and Trees.
Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

On the Relationship Between Energy Complexity and Other Boolean Function Measures.
Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

2018
Path cooperative games.
J. Comb. Optim., 2018

Quantum Lovász Local Lemma: Shearer's Bound is Tight.
Electronic Colloquium on Computational Complexity (ECCC), 2018

Structured decomposition for reversible Boolean functions.
CoRR, 2018

On the Relationship between Energy Complexity and Other Boolean Function Measures.
CoRR, 2018

Coreness of Cooperative Games with Truncated Submodular Profit Functions.
CoRR, 2018

Quantum Lovász Local Lemma: Shearer's Bound is Tight.
CoRR, 2018

Higher order monotonicity and submodularity of influence in social networks: from local to global.
CoRR, 2018

Exact quantum query complexity of weight decision problems.
CoRR, 2018

Coreness of Cooperative Games with Truncated Submodular Profit Functions.
Proceedings of the Algorithmic Game Theory - 11th International Symposium, 2018

Adaptive operation-space control of redundant manipulators with joint limits avoidance.
Proceedings of the Tenth International Conference on Advanced Computational Intelligence, 2018

Neural network based adaptive region tracking control for a swarm of ships in constrained space.
Proceedings of the Tenth International Conference on Advanced Computational Intelligence, 2018

Real-Time Object Detection and Semantic Segmentation Hardware System with Deep Learning Networks.
Proceedings of the International Conference on Field-Programmable Technology, 2018

On the Decision Tree Complexity of String Matching.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

Boosting Dynamic Programming with Neural Networks for Solving NP-hard Problems.
Proceedings of The 10th Asian Conference on Machine Learning, 2018

Anti-occlusion Light-Field Optical Flow Estimation Using Light-Field Super-Pixels.
Proceedings of the Computer Vision - ACCV 2018 Workshops, 2018

2017
Sulfophenyl-Functionalized Reduced Graphene Oxide Networks on Electrospun 3D Scaffold for Ultrasensitive NO2 Gas Sensor.
Sensors, 2017

Three-Dimensional Measurement for Specular Reflection Surface Based on Reflection Component Separation and Priority Region Filling Theory.
Sensors, 2017

Near optimal algorithms for online weighted bipartite matching in adversary model.
J. Comb. Optim., 2017

Image retrieval by information fusion based on scalable vocabulary tree and robust Hausdorff distance.
EURASIP J. Adv. Sig. Proc., 2017

On the Decision Tree Complexity of String Matching.
CoRR, 2017

A Linear Algorithm for Finding the Sink of Unique Sink Orientations on Grids.
CoRR, 2017

Partial Sorting Problem on Evolving Data.
Algorithmica, 2017

On the Sensitivity Complexity of k-Uniform Hypergraph Properties.
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

Influence Maximization with ε-Almost Submodular Threshold Functions.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

On the Modulo Degree Complexity of Boolean Functions.
Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

A Tighter Relation Between Sensitivity Complexity and Certificate Complexity.
Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

Efficient Delivery Policy to Minimize User Traffic Consumption in Guaranteed Advertising.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

Randomized Mechanisms for Selling Reserved Instances in Cloud Computing.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Computing the least-core and nucleolus for threshold cardinality matching games.
Theor. Comput. Sci., 2016

Efficient Delivery Policy to Minimize User Traffic Consumption in Guaranteed Advertising.
CoRR, 2016

Randomized Mechanisms for Selling Reserved Instances in Cloud.
CoRR, 2016

Community Detection: a Refined Axiomization and Beyond.
CoRR, 2016

Cumulative Activation in Social Networks.
CoRR, 2016

On the Optimality of Tape Merge of Two Lists with Similar Size.
CoRR, 2016

On the Sensitivity Complexity of $k$-Uniform Hypergraph Properties.
CoRR, 2016

A Tighter Relation between Sensitivity and Certificate Complexity.
CoRR, 2016

On the Optimality of Tape Merge of Two Lists with Similar Size.
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

Projecting Distortion Calibration and Evaluation of Coding Fringes in Structured Light System.
Proceedings of the Social Computing, 2016

Communities in Preference Networks: Refined Axioms and Beyond.
Proceedings of the IEEE 16th International Conference on Data Mining, 2016

Shortest Paths on Evolving Graphs.
Proceedings of the Computational Social Networks - 5th International Conference, 2016

The Routing of Complex Contagion in Kleinberg's Small-World Networks.
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

Learning Market Parameters Using Aggregate Demand Queries.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
Any monotone property of 3-uniform hypergraphs is weakly evasive.
Theor. Comput. Sci., 2015

Ag-Modified In2O3/ZnO Nanobundles with High Formaldehyde Gas-Sensing Performance.
Sensors, 2015

The Least-core and Nucleolus of Path Cooperative Games.
CoRR, 2015

The Routing of Complex Contagion in Kleinberg's Small-World Networks.
CoRR, 2015

On the Power of Parity Queries in Boolean Decision Trees.
Proceedings of the Theory and Applications of Models of Computation, 2015

How to Select the Top k Elements from Evolving Data?
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

Multi-Classes Feature Engineering with Sliding Window for Purchase Prediction in Mobile Commerce.
Proceedings of the IEEE International Conference on Data Mining Workshop, 2015

The Least-Core and Nucleolus of Path Cooperative Games.
Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

Tight Bounds for Graph Problems in Insertion Streams.
Proceedings of the Approximation, 2015

2014
Any Monotone Property of 3-uniform Hypergraphs is Weakly Evasive.
Electronic Colloquium on Computational Complexity (ECCC), 2014

Tighter Relations Between Sensitivity and Other Complexity Measures.
Electronic Colloquium on Computational Complexity (ECCC), 2014

Minimizing Seed Set Selection with Probabilistic Coverage Guarantee in a Social Network.
CoRR, 2014

Deterministic Protocol for Shared $Q$-queue $J$-choice $K$-best Secretary Problem.
CoRR, 2014

On The Communication Complexity of Linear Algebraic Problems in the Message Passing Model.
CoRR, 2014

How to select the largest k elements from evolving data?
CoRR, 2014

Computing the Least-core and Nucleolus for Threshold Cardinality Matching Games.
CoRR, 2014

Tighter Relations Between Sensitivity and Other Complexity Measures.
CoRR, 2014

A Pavement Crack Detection Method Combining 2D with 3D Information Based on Dempster-Shafer Theory.
Comp.-Aided Civil and Infrastruct. Engineering, 2014

Computing the Least-Core and Nucleolus for Threshold Cardinality Matching Games.
Proceedings of the Web and Internet Economics - 10th International Conference, 2014

On the Communication Complexity of Linear Algebraic Problems in the Message Passing Model.
Proceedings of the Distributed Computing - 28th International Symposium, 2014

Minimizing seed set selection with probabilistic coverage guarantee in a social network.
Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2014

Solving Multi-choice Secretary Problem in Parallel: An Optimal Observation-Selection Protocol.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Tighter Relations between Sensitivity and Other Complexity Measures.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013
On the sensitivity complexity of bipartite graph properties.
Theor. Comput. Sci., 2013

Exponential Quantum-Classical Gaps in Multiparty Nondeterministic Communication Complexity.
Electronic Colloquium on Computational Complexity (ECCC), 2013

On a conjecture of Butler and Graham.
Des. Codes Cryptogr., 2013

Orbit Problem Revisited
CoRR, 2013

New upper bound on block sensitivity and certificate complexity in terms of sensitivity.
CoRR, 2013

Any Monotone Property of 3-Uniform Hypergraphs Is Weakly Evasive.
Proceedings of the Theory and Applications of Models of Computation, 2013

Determinantal Complexities and Field Extensions.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

Space-bounded communication complexity.
Proceedings of the Innovations in Theoretical Computer Science, 2013

Optimal Pricing for Improving Efficiency of Taxi Systems.
Proceedings of the IJCAI 2013, 2013

Adaptive Region Tracking Control for Multi-Ships Coordination.
Proceedings of the 3rd IFAC International Conference on Intelligent Control and Automation Science, 2013

Influence Maximization in Dynamic Social Networks.
Proceedings of the 2013 IEEE 13th International Conference on Data Mining, 2013

2012
Graph Coloring Applied to Secure Computation in Non-Abelian Groups.
J. Cryptology, 2012

Stam's Conjecture and Threshold Phenomena in Collision Resistance.
IACR Cryptology ePrint Archive, 2012

Pavement crack characteristic detection based on sparse representation.
EURASIP J. Adv. Sig. Proc., 2012

Conquering the rating bound problem in neighborhood-based collaborative filtering: a function recovery approach
CoRR, 2012

Randomized Communication Complexity for Linear Algebra Problems over Finite Fields.
Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

The Relationship between Inner Product and Counting Cycles.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Space-Efficient Approximation Scheme for Circular Earth Mover Distance.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Streaming and Communication Complexity of Clique Approximation.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Stam's Conjecture and Threshold Phenomena in Collision Resistance.
Proceedings of the Advances in Cryptology - CRYPTO 2012, 2012

2011
An improved lower bound on the sensitivity complexity of graph properties.
Theor. Comput. Sci., 2011

Bounds and trade-offs for Double-Base Number Systems.
Inf. Process. Lett., 2011

New separation between s(f) and bs(f).
Electronic Colloquium on Computational Complexity (ECCC), 2011

New separation between $s(f)$ and $bs(f)$
CoRR, 2011

On a Conjecture of Butler and Graham
CoRR, 2011

A New Variation of Hat Guessing Games
CoRR, 2011

A Better Upper Bound on Weights of Exact Threshold Functions.
Proceedings of the Theory and Applications of Models of Computation, 2011

A New Variation of Hat Guessing Games.
Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

2010
The Complexity of Word Circuits.
Discrete Math., Alg. and Appl., 2010

Quantum Separation of Local Search and Fixed Point Computation.
Algorithmica, 2010

Weights of Exact Threshold Functions.
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

The Complexity of Word Circuits.
Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

2009
The antimagicness of the Cartesian product of graphs.
Theor. Comput. Sci., 2009

More Efficient Algorithms for Closest String and Substring Problems.
SIAM J. Comput., 2009

On the Quantum Query Complexity of Local Search in Two and Three Dimensions.
Algorithmica, 2009

2008
Searching monotone multi-dimensional arrays.
Discrete Mathematics, 2008

More Efficient Algorithms for Closest String and Substring Problems.
Proceedings of the Research in Computational Molecular Biology, 2008

Quantum Separation of Local Search and Fixed Point Computation.
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

Generalized Tsirelson Inequalities, Commuting-Operator Provers, and Multi-prover Interactive Proof Systems.
Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, 2008

Graph Design for Secure Multiparty Computation over Non-Abelian Groups.
Proceedings of the Advances in Cryptology, 2008

2007
Block sensitivity of weakly symmetric functions.
Theor. Comput. Sci., 2007

The communication and streaming complexity of computing the longest common and increasing subsequences.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

2006
Block Sensitivity of Weakly Symmetric Functions.
Proceedings of the Theory and Applications of Models of Computation, 2006

Research of the Path Planning Complexity for Autonomous Mobile Robot under Dynamic Environments.
Proceedings of the Sixth International Conference on Intelligent Systems Design and Applications (ISDA 2006), 2006

On the Quantum Query Complexity of Local Search in Two and Three Dimensions.
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

2005
The existence of quantum entanglement catalysts.
IEEE Trans. Information Theory, 2005

MPEG video markup language and its applications to robust video transmission.
J. Visual Communication and Image Representation, 2005

Searching Monotone Multi-dimensional Arrays
CoRR, 2005

Rapid Algorithms for MPEG-2 to H.264 Transcoding.
Proceedings of the Advances in Multimedia Information Processing, 2005

2004
Performance evaluation for energy efficient topologic control in ad hoc wireless networks.
Theor. Comput. Sci., 2004

On complexity of single-minded auction.
J. Comput. Syst. Sci., 2004

Robust wireless video transmission using MPML.
Proceedings of the Visual Information Processing XIII, Orlando, FL, USA, April 12, 2004, 2004

An object-oriented approach for harmonization of multimedia markup languages.
Proceedings of the Storage and Retrieval Methods and Applications for Multimedia 2004, 2004

Robust video transmission using MPEG Markup Language and adaptive error correction codes.
Proceedings of the 2004 IEEE International Conference on Multimedia and Expo, 2004

Object-oriented harmonization of multimedia XML applications.
Proceedings of the 2004 IEEE International Conference on Multimedia and Expo, 2004

A fluid model for error propagation characterization in video coding.
Proceedings of the 2004 International Conference on Image Processing, 2004

Dynamic Price Sequence and Incentive Compatibility (Extended Abstract).
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

Fisher Equilibrium Price with a Class of Concave Utility Functions.
Proceedings of the Algorithms, 2004

Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go?
Proceedings of the 19th Annual IEEE Conference on Computational Complexity (CCC 2004), 2004

2003
A 3-Party Simultaneous Protocol for SUM-INDEX.
Algorithmica, 2003

Performance evaluation of MPML-based error resilient video transmission.
Proceedings of the Visual Information Processing XII, Orlando, FL, USA, April 21, 2003, 2003

Multicast video synchronization via MPEG-4 FGS/XML representation.
Proceedings of the 2003 International Symposium on Circuits and Systems, 2003

2002
XML-based MPEG-4 Video Representation, Streaming and Error Resilience.
Proceedings of the Visual Information Processing XI, Orlando, FL, USA, April 1, 2002, 2002

2000
Image Retrieval by Shape: A Comparative Study.
Proceedings of the 2000 IEEE International Conference on Multimedia and Expo, 2000


  Loading...