Sangxia Huang

According to our database, Sangxia Huang authored at least 19 papers between 2010 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Geometry-Biased Transformer for Robust Multi-View 3D Human Pose Reconstruction.

Olivier Moliner, Sangxia Huang, Kalle Åström

Proceedings of the 18th IEEE International Conference on Automatic Face and Gesture Recognition, 2024

2022

Bootstrapped Representation Learning for Skeleton-Based Action Recognition.

Olivier Moliner, Sangxia Huang, Kalle Åström

Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops, 2022

2020

MM-Fit: Multimodal Deep Learning for Automatic Exercise Logging across Sensing Devices.

David Strömbäck, Sangxia Huang, Valentin Radu

Proc. ACM Interact. Mob. Wearable Ubiquitous Technol., 2020

Better Prior Knowledge Improves Human-Pose-Based Extrinsic Camera Calibration.

Olivier Moliner, Sangxia Huang, Kalle Åström

Proceedings of the 25th International Conference on Pattern Recognition, 2020

2018

Small Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits.

Abbas Bazzi, Samuel Fiorini, Sangxia Huang, Ola Svensson

Theory Comput., 2018

Adversarial Attacks and Defences Competition.

Alexey Kurakin, Ian J. Goodfellow, Samy Bengio, Yinpeng Dong, Fangzhou Liao, Ming Liang, Tianyu Pang, Jun Zhu, Xiaolin Hu, Cihang Xie, Jianyu Wang, Zhishuai Zhang, Zhou Ren, Alan L. Yuille, Sangxia Huang, Yao Zhao, Yuzhe Zhao, Zhonglin Han, Junjiajia Long, Yerkebulan Berdibekov, Takuya Akiba, Seiya Tokui, Motoki Abe

CoRR, 2018

Semi-Supervised Algorithms for Approximately Optimal and Accurate Clustering.

Buddhima Gamlath, Sangxia Huang, Ola Svensson

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017

Improved NP-Inapproximability for 2-Variable Linear Equations.

Johan Håstad, Sangxia Huang, Rajsekar Manokaran, Ryan O'Donnell, John Wright

Theory Comput., 2017

2016

A Dichotomy for Real Weighted Holant Problems.

Sangxia Huang, Pinyan Lu

Comput. Complex., 2016

2015

Hardness of Constraint Satisfaction and Hypergraph Coloring: Constructions of Probabilistically Checkable Proofs with Perfect Completeness.

Sangxia Huang

PhD thesis, 2015

2^{(\log N)^1/4-o(1)} Hardness for Hypergraph Coloring.

Sangxia Huang

Electron. Colloquium Comput. Complex., 2015

$2^{(\log N)^{1/4-o(1)}}$ Hardness for Hypergraph Coloring.

Sangxia Huang

CoRR, 2015

2014

Approximation Resistance on Satisfiable Instances for Sparse Predicates.

Sangxia Huang

Theory Comput., 2014

2013

Approximation resistance on satisfiable instances for predicates with few accepting inputs.

Sangxia Huang

Proceedings of the Symposium on Theory of Computing Conference, 2013

Improved Hardness of Approximating Chromatic Number.

Sangxia Huang

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013

2012

Approximation Resistance on Satisfiable Instances for Predicates Strictly Dominating Parity.

Sangxia Huang

Electron. Colloquium Comput. Complex., 2012

From Holant to #CSP and Back: Dichotomy for Holant c Problems.

Jin-Yi Cai, Sangxia Huang, Pinyan Lu

Algorithmica, 2012

2011

The Complexity of Weighted Boolean #CSP Modulo k.

Heng Guo, Sangxia Huang, Pinyan Lu, Mingji Xia

Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

2010

From Holant to #CSP and Back: Dichotomy for Holant^<i>c</i> Problems.

Jin-yi Cai, Sangxia Huang, Pinyan Lu

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010