Go to Header
Go to Navigation
Go to Content
Go to Footer
Login
Help
中文（繁體）
Research Resources
CUHK UPDates
Theses
Experts List
User Guides
About Us
List of areas
> Algorithms & computation theory
Home
Research Outputs
Researcher Profiles
Department Profiles
Research Areas
Algorithms & computation theory
Research Area
»
Engineering
»
Computer science
Code
:
0710
Most Relevant People
BOGDANOV
,
Andrej
TAO
,
Yufei
Related People
LIN
,
Xiaojun
Most Relevant Research Outputs
1 of 6
Accelerating Random Orthogonal Search for Global Optimization using Crossover
(
2023
)
Acyclicity Programming for Sigma-Protocols
(
2021
)
A Gentle Introduction to Zero-Knowledge
(
2021
)
Algorithmic Techniques for Independent Query Sampling
(
2022
)
A Near-Optimal Parallel Algorithm for Joining Binary Relations
(
2022
)
An Efficient Algorithm for Distance-based Structural Graph Clustering
(
2023
)
An Index for Set Intersection with Post-Filtering
(
2024
)
An STL-based Approach to Resilient Control for Cyber-Physical Systems
(
2023
)
A Survey on Automated Log Analysis for Reliability Engineering
(
2021
)
Attentional Transfer is All You Need: Technology-aware Layout Pattern Generation
(
2021
)
Related Research Outputs
1 of 2
Adaptable Modular Construction Systems and Multi-Objective Optimisation Strategies for Mass-Customised Housing: A New User-driven Paradigm for High-rise Living in Hong Kong
(
2022
)
A Nearly-Linear Time Algorithm for Exact Community Recovery in Stochastic Block Model
(
2020
)
An Efficient Alternating Direction Method for Graph Learning from Smooth Signals
(
2021
)
A Newton Tracking Algorithm with Exact Linear Convergence for Decentralized Consensus Optimization
(
2021
)
A Newton Tracking Algorithm with Exact Linear Convergence Rate for Decentralized Consensus Optimization
(
2021
)
Application of Variational AutoEncoder (VAE) Model and Image Processing Approaches in Game Design
(
2023
)
Boosting First-Order Methods by Shifting Objective: New Schemes with Faster Worst Case Rates
(
2020
)
CoCoS: Enhancing Semi-Supervised Learning on Graphs with Unlabeled Data via Contrastive Context Sharing
(
2022
)
Dynamic Regret Bound for Moving Target Tracking Based on Online Time-of-Arrival Measurements
(
2021
)
Fast Epigraphical Projection-Based Incremental Algorithms for Wasserstein Distributionally Robust Support Vector Machine
(
2020
)
Share Link
Last updated on 2020-30-12 at 10:40
Share Link
Your name*
Your email*
Recipient's name*
Recipient's email*
Message
Auxilliary Information
No information will be stored or shared with any third party.
Cancel
Our policy towards the use of cookies
All Clarivate Analytics websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.
Ok to Continue
Cookie Policy
