Shengyu Zhang

According to our database1, Shengyu Zhang authored at least 83 papers between 2004 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Performance analysis and improvement of large-scale antenna array system.
Journal of Intelligent and Fuzzy Systems, 2020

2019
Measuring the Local and Global Variabilities in Body Sway by Nonlinear Poincaré Technology.
IEEE Trans. Instrumentation and Measurement, 2019

Alchemy: A Quantum Chemistry Dataset for Benchmarking AI Models.
CoRR, 2019

A Meta Approach to Defend Noisy Labels by the Manifold Regularizer PSDR.
CoRR, 2019

Utilizing Edge Features in Graph Neural Networks via Variational Information Maximization.
CoRR, 2019

Rethinking the Usage of Batch Normalization and Dropout in the Training of Deep Neural Networks.
CoRR, 2019

Cost-effective fiber fault monitoring using MLMW-OOCs in high-capacity PONs considering user geographical distribution.
Computer Communications, 2019

Energy-Aware Virtual Optical Network Embedding in Sliceable-Transponder-Enabled Elastic Optical Networks.
IEEE Access, 2019

An Edge-Assisted Data Distribution Method for Vehicular Network Services.
IEEE Access, 2019

Channel Tracking and Transmission Design in 5G Large-Scale MIMO System.
IEEE Access, 2019

Personalized fairness-aware re-ranking for microlending.
Proceedings of the 13th ACM Conference on Recommender Systems, 2019

Understanding and Utilizing Deep Neural Networks Trained with Noisy Labels.
Proceedings of the 36th International Conference on Machine Learning, 2019

2018
Linear-Time Algorithm for Quantum 2SAT.
Theory of Computing, 2018

Achieving verifiable, dynamic and efficient auditing for outsourced database in cloud.
J. Parallel Distrib. Comput., 2018

Quantum algorithms for feedforward neural networks.
CoRR, 2018

Psrec: social recommendation with pseudo ratings.
Proceedings of the 12th ACM Conference on Recommender Systems, 2018

Field-aware probabilistic embedding neural network for CTR prediction.
Proceedings of the 12th ACM Conference on Recommender Systems, 2018

Text-to-Image Synthesis via Visual-Memory Creative Adversarial Network.
Proceedings of the Advances in Multimedia Information Processing - PCM 2018, 2018

Optimization of Center-of-Pressure-Based Indices for Assessing Balance Ability.
Proceedings of the 2018 IEEE International Symposium on Medical Measurements and Applications, 2018

Policy Optimization with Second-Order Advantage Information.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Pairwise-Combination-Based DBA Scheme for Energy-efficient Low-latency TDM-PONs.
Proceedings of the 10th International Conference on Advanced Infocomm Technology, 2018

Contextual Dependent Click Bandit Algorithm for Web Recommendation.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

Design of Claw-like Hand-foot Fusion Mechanism for the Multi-legged Robot.
Proceedings of the 2018 IEEE/ASME International Conference on Advanced Intelligent Mechatronics, 2018

Online Clustering of Contextual Cascading Bandits.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

Algorithms for Trip-Vehicle Assignment in Ride-Sharing.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Fast quantum algorithms for least squares regression and statistic leverage scores.
Theor. Comput. Sci., 2017

Adjusted weight voting algorithm for random forests in handling missing values.
Pattern Recognition, 2017

Quantum game players can have advantage without discord.
Inf. Comput., 2017

Multipartite Quantum Correlation and Communication Complexities.
Computational Complexity, 2017

Online Roommate Allocation Problem.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Networked Fairness in Cake Cutting.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Learning to Aggregate Ordinal Labels by Maximizing Separating Width.
Proceedings of the 34th International Conference on Machine Learning, 2017

Sensitivity Conjecture and Log-Rank Conjecture for Functions with Small Alternating Numbers.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Energy Efficient Dynamic Virtual Optical Network Embedding in Sliceable-Transponder-Equipped EONs.
Proceedings of the 2017 IEEE Global Communications Conference, 2017

2016
Trial and Error Algorithms.
Encyclopedia of Algorithms, 2016

Double Layer LEO Satellite Based "BigMAC" Space Information Network Architecture.
Proceedings of the Space Information Networks - First International Conference, 2016

On the Complexity of Probabilistic Trials for Hidden Satisfiability Problems.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Contextual Combinatorial Cascading Bandits.
Proceedings of the 33nd International Conference on Machine Learning, 2016

Fourier Sparsity of GF(2) Polynomials.
Proceedings of the Computer Science - Theory and Applications, 2016

Assignment and Pricing in Roommate Market.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
Semiquantum key distribution without invoking the classical party's measurement capability.
Quantum Information Processing, 2015

Fast Relative-Error Approximation Algorithm for Ridge Regression.
Proceedings of the Thirty-First Conference on Uncertainty in Artificial Intelligence, 2015

Secure cloud storage hits distributed string equality checking: More efficient, conceptually simpler, and provably secure.
Proceedings of the 2015 IEEE Conference on Computer Communications, 2015

On The I/O Complexity of Dynamic Distinct Counting.
Proceedings of the 18th International Conference on Database Theory, 2015

Solving Linear Programming with Constraints Unknown.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Social Models and Algorithms for Optimization of Contact Immunity of Oral Polio Vaccine.
Proceedings of the Frontiers in Algorithmics - 9th International Workshop, 2015

A Semantic Hash Tree Based Verifiable Data Access Protocol on the Cloud.
Proceedings of the Third International Conference on Advanced Cloud and Big Data, 2015

2014
Approximate and Multipartite Quantum Correlation (Communication) Complexity.
CoRR, 2014

Efficient quantum protocols for XOR functions.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2013
Efficient Protocols for Generating Bipartite Classical Distributions and Quantum States.
IEEE Trans. Information Theory, 2013

Full characterization of quantum correlated equilibria.
Quantum Information & Computation, 2013

Quantum and randomized communication complexity of XOR functions in the SMP model.
Electronic Colloquium on Computational Complexity (ECCC), 2013

Fourier Sparsity, Spectral Norm, and the Log-Rank Conjecture.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

2012
BQP-Complete Problems.
Proceedings of the Handbook of Natural Computing, 2012

On the Power of a Unique Quantum Witness.
Theory of Computing, 2012

On the Complexity of Trial and Error.
Electronic Colloquium on Computational Complexity (ECCC), 2012

Correlation/Communication complexity of generating bipartite states
CoRR, 2012

A Quantum Protocol for Sampling Correlated Equilibria Unconditionally and without a Mediator.
Proceedings of the Theory of Quantum Computation, 2012

Quantum strategic game theory.
Proceedings of the Innovations in Theoretical Computer Science 2012, 2012

2011
The Influence Lower Bound Via Query Elimination.
Theory of Computing, 2011

Tight bounds on the randomized communication complexity of symmetric XOR functions in one-way and SMP models.
Electronic Colloquium on Computational Complexity (ECCC), 2011

On characterizing quantum correlated equilibria
CoRR, 2011

Tight Bounds on Communication Complexity of Symmetric XOR Functions in One-Way and SMP Models.
Proceedings of the Theory and Applications of Models of Computation, 2011

On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Fractional Fourier domain communication system: System structure and signal modeling.
Proceedings of the 6th International ICST Conference on Communications and Networking in China, 2011

2010
Any AND-OR Formula of Size N Can Be Evaluated in Time N1/2+o(1) on a Quantum Computer.
SIAM J. Comput., 2010

Composition Theorems in Communication Complexity.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas.
Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

2009
New bounds on classical and quantum one-way communication complexity.
Theor. Comput. Sci., 2009

Tight Bounds for Randomized and Quantum Local Search.
SIAM J. Comput., 2009

Combinatorial algorithms for nearest neighbors, near-duplicates and small-world design.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

On the Tightness of the Buhrman-Cleve-Wigderson Simulation.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008
Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007
Distributed rate allocation for inelastic flows.
IEEE/ACM Trans. Netw., 2007

Streaming Algorithms Measured in Terms of the Computed Quantity.
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

2006
The communication complexity of the Hamming distance problem.
Inf. Process. Lett., 2006

New upper and lower bounds for randomized and quantum local search.
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

2005
On the power of Ambainis lower bounds.
Theor. Comput. Sci., 2005

(Almost) tight bounds for randomized and quantum Local Search on hypercubes and grids
Electronic Colloquium on Computational Complexity (ECCC), 2005

Distributed rate allocation for inelastic flows: optimization frameworks, optimality conditions, and optimal algorithms.
Proceedings of the INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005

Promised and Distributed Quantum Search.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004
On the Power of Ambainis's Lower Bounds.
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 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


  Loading...