default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSangxia Huang
Person information
- affiliation: Royal Institute of Technology, Stockholm, Sweden
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c11]Olivier Moliner
, Sangxia Huang, Kalle Åström:
Geometry-Biased Transformer for Robust Multi-View 3D Human Pose Reconstruction. FG 2024: 1-8- 2023
- [i10]Olivier Moliner, Sangxia Huang, Kalle Åström:
Geometry-Biased Transformer for Robust Multi-View 3D Human Pose Reconstruction. CoRR abs/2312.17106 (2023) - 2022
- [c10]Olivier Moliner, Sangxia Huang, Kalle Åström:
Bootstrapped Representation Learning for Skeleton-Based Action Recognition. CVPR Workshops 2022: 4153-4163 - [i9]Olivier Moliner, Sangxia Huang, Kalle Åström:
Bootstrapped Representation Learning for Skeleton-Based Action Recognition. CoRR abs/2202.02232 (2022) - 2020
- [j6]David Strömbäck, Sangxia Huang, Valentin Radu:
MM-Fit: Multimodal Deep Learning for Automatic Exercise Logging across Sensing Devices. Proc. ACM Interact. Mob. Wearable Ubiquitous Technol. 4(4): 168:1-168:22 (2020) - [c9]Olivier Moliner, Sangxia Huang, Kalle Åström:
Better Prior Knowledge Improves Human-Pose-Based Extrinsic Camera Calibration. ICPR 2020: 4758-4765
2010 – 2019
- 2018
- [j5]Abbas Bazzi, Samuel Fiorini, Sangxia Huang, Ola Svensson:
Small Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits. Theory Comput. 14(1): 1-29 (2018) - [c8]Buddhima Gamlath, Sangxia Huang, Ola Svensson:
Semi-Supervised Algorithms for Approximately Optimal and Accurate Clustering. ICALP 2018: 57:1-57:14 - [i8]Buddhima Gamlath, Sangxia Huang, Ola Svensson:
Semi-Supervised Algorithms for Approximately Optimal and Accurate Clustering. CoRR abs/1803.00926 (2018) - [i7]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:
Adversarial Attacks and Defences Competition. CoRR abs/1804.00097 (2018) - 2017
- [j4]Johan Håstad, Sangxia Huang, Rajsekar Manokaran, Ryan O'Donnell, John Wright:
Improved NP-Inapproximability for 2-Variable Linear Equations. Theory Comput. 13(1): 1-51 (2017) - [c7]Abbas Bazzi, Samuel Fiorini, Sangxia Huang, Ola Svensson:
Small Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits. SODA 2017: 2326-2341 - 2016
- [j3]Sangxia Huang, Pinyan Lu:
A Dichotomy for Real Weighted Holant Problems. Comput. Complex. 25(1): 255-304 (2016) - [i6]Abbas Bazzi, Samuel Fiorini, Sangxia Huang, Ola Svensson:
Small Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits. CoRR abs/1609.03737 (2016) - 2015
- [b1]Sangxia Huang:
Hardness of Constraint Satisfaction and Hypergraph Coloring: Constructions of Probabilistically Checkable Proofs with Perfect Completeness. KTH Royal Institute of Technology, Sweden, 2015 - [c6]Johan Håstad, Sangxia Huang, Rajsekar Manokaran, Ryan O'Donnell, John Wright:
Improved NP-Inapproximability for 2-Variable Linear Equations. APPROX-RANDOM 2015: 341-360 - [i5]Sangxia Huang:
$2^{(\log N)^{1/4-o(1)}}$ Hardness for Hypergraph Coloring. CoRR abs/1504.03923 (2015) - [i4]Sangxia Huang:
2(\log N)1/4-o(1) Hardness for Hypergraph Coloring. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j2]Sangxia Huang:
Approximation Resistance on Satisfiable Instances for Sparse Predicates. Theory Comput. 10: 359-388 (2014) - 2013
- [c5]Sangxia Huang:
Improved Hardness of Approximating Chromatic Number. APPROX-RANDOM 2013: 233-243 - [c4]Sangxia Huang:
Approximation resistance on satisfiable instances for predicates with few accepting inputs. STOC 2013: 457-466 - [i3]Sangxia Huang:
Improved Hardness of Approximating Chromatic Number. CoRR abs/1301.5216 (2013) - 2012
- [j1]Jin-Yi Cai, Sangxia Huang, Pinyan Lu:
From Holant to #CSP and Back: Dichotomy for Holant c Problems. Algorithmica 64(3): 511-533 (2012) - [c3]Sangxia Huang, Pinyan Lu:
A Dichotomy for Real Weighted Holant Problems. CCC 2012: 96-106 - [i2]Sangxia Huang:
Approximation Resistance on Satisfiable Instances for Predicates Strictly Dominating Parity. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [c2]Heng Guo, Sangxia Huang, Pinyan Lu, Mingji Xia:
The Complexity of Weighted Boolean #CSP Modulo k. STACS 2011: 249-260 - 2010
- [c1]Jin-yi Cai, Sangxia Huang, Pinyan Lu:
From Holant to #CSP and Back: Dichotomy for Holantc Problems. ISAAC (1) 2010: 253-265 - [i1]Jin-yi Cai, Sangxia Huang, Pinyan Lu:
From Holant To #CSP And Back: Dichotomy For Holant$^c$ Problems. CoRR abs/1004.0803 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-14 21:13 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
