default search action
Xiaoxun Sun
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
- [j15]Carlos Hernández, Tansel Uras, Sven Koenig, Jorge A. Baier, Xiaoxun Sun, Pedro Meseguer:
Reusing cost-minimal paths for goal-directed navigation in partially known terrains. Auton. Agents Multi Agent Syst. 29(5): 850-895 (2015) - [c35]William Yeoh, Pradeep Varakantham, Xiaoxun Sun, Sven Koenig:
Incremental DCOP Search Algorithms for Solving Dynamic DCOP Problems. WI-IAT (2) 2015: 257-264 - 2014
- [c34]Ling Tan, Xiaoxun Sun, Siek Toon Khoo:
Can Engagement be Compared? Measuring Academic Engagement for Comparison. EDM 2014: 213-216 - 2013
- [j14]Xiaoxun Sun, Lili Sun:
Privacy Preserving Large-Scale Rating Data Publishing. EAI Endorsed Trans. Scalable Inf. Syst. 1(1): e3 (2013) - 2012
- [j13]Xiaoxun Sun, Hua Wang, Jiuyong Li, Yanchun Zhang:
Satisfying Privacy Requirements Before Data Anonymization. Comput. J. 55(4): 422-437 (2012) - [j12]Xiaoxun Sun, Hua Wang, Yanchun Zhang:
On the identity anonymization of high-dimensional rating data. Concurr. Comput. Pract. Exp. 24(10): 1108-1122 (2012) - [j11]Xiaoxun Sun, Hua Wang, Jiuyong Li, Yanchun Zhang:
An approximate microaggregation approach for microdata protection. Expert Syst. Appl. 39(2): 2211-2219 (2012) - [j10]Traian Marius Truta, Alina Campan, Xiaoxun Sun:
An Overview of P-Sensitive k-Anonymity Models for Microdata Anonymization. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 20(6): 819-838 (2012) - [j9]Min Li, Xiaoxun Sun, Hua Wang, Yanchun Zhang:
Multi-level delegations with trust management in access control systems. J. Intell. Inf. Syst. 39(3): 611-626 (2012) - [c33]Xiaoxun Sun, Tansel Uras, Sven Koenig, William Yeoh:
Incremental ARA*: An Incremental Anytime Search Algorithm for Moving-Target Search. ICAPS 2012 - [c32]Xiaoxun Sun:
Finding Dependent Test Items: An Information Theory Based Approach. EDM 2012: 222-223 - 2011
- [j8]Xiaoxun Sun, Lili Sun, Hua Wang:
Extended k-anonymity models against sensitive attribute disclosure. Comput. Commun. 34(4): 526-535 (2011) - [j7]Xiaoxun Sun, Hua Wang, Jiuyong Li, Yanchun Zhang:
Injecting purpose and trust into data anonymisation. Comput. Secur. 30(5): 332-345 (2011) - [j6]Xiaoxun Sun, Hua Wang, Jiuyong Li, Jian Pei:
Publishing anonymous survey rating data. Data Min. Knowl. Discov. 23(3): 379-406 (2011) - [j5]Xiaoxun Sun, Min Li, Hua Wang:
A family of enhanced (L, alpha)-diversity models for privacy preserving data publishing. Future Gener. Comput. Syst. 27(3): 348-356 (2011) - [j4]Min Li, Xiaoxun Sun, Hua Wang, Yanchun Zhang, Ji Zhang:
Privacy-aware access control with trust management in web service. World Wide Web 14(4): 407-430 (2011) - [c31]Carlos Hernández, Xiaoxun Sun, Sven Koenig, Pedro Meseguer:
Tree Adaptive A. AAMAS 2011: 123-130 - [c30]William Yeoh, Pradeep Varakantham, Xiaoxun Sun, Sven Koenig:
Incremental DCOP search algorithms for solving dynamic DCOPs. AAMAS 2011: 1069-1070 - [p2]Xiaoxun Sun, Min Li:
Graph Representation and Anonymization in Large Survey Rating Data. Graph Data Management 2011: 315-333 - [p1]Xiaoxun Sun, Hua Wang, Jiuyong Li:
Validating Privacy Requirements in Large Survey Rating Data. Next Generation Data Technologies for Collective Computational Intelligence 2011: 445-469 - 2010
- [c29]Xiaoxun Sun, William Yeoh, Sven Koenig:
Moving target D* Lite. AAMAS 2010: 67-74 - [c28]Xiaoxun Sun, William Yeoh, Sven Koenig:
Generalized Fringe-Retrieving A*: faster moving target search on state lattices. AAMAS 2010: 1081-1088 - [c27]Xiaoxun Sun, Hua Wang:
Towards Identify Anonymization in Large Survey Rating Data. NSS 2010: 99-104 - [c26]Xiaoxun Sun, Hua Wang, Jiuyong Li:
Satisfying Privacy Requirements: One Step before Anonymization. PAKDD (1) 2010: 181-188 - [c25]David Bond, Niels A. Widger, Wheeler Ruml, Xiaoxun Sun:
Real-Time Search in Dynamic Worlds. SOCS 2010: 16-22
2000 – 2009
- 2009
- [j3]Sven Koenig, Xiaoxun Sun:
Comparing real-time and incremental heuristic search for real-time situated agents. Auton. Agents Multi Agent Syst. 18(3): 313-341 (2009) - [j2]Xiaotie Deng, Qizhi Fang, Xiaoxun Sun:
Finding nucleolus of flow game. J. Comb. Optim. 18(1): 64-86 (2009) - [c24]Xiaoxun Sun, Hua Wang, Jiuyong Li:
Microdata Protection Through Approximate Microaggregation. ACSC 2009: 149-156 - [c23]Carlos Hernández, Pedro Meseguer, Xiaoxun Sun, Sven Koenig:
Path-Adaptive A* for Incremental Heuristic Search in Unknown Terrain. ICAPS 2009 - [c22]Xiaoxun Sun, William Yeoh, Sven Koenig:
Dynamic fringe-saving A*. AAMAS (2) 2009: 891-898 - [c21]Xiaoxun Sun, William Yeoh, Po-An Chen, Sven Koenig:
Simple optimization techniques for A*-based search. AAMAS (2) 2009: 931-936 - [c20]Xiaoxun Sun, Hua Wang, Jiuyong Li:
Injecting purpose and trust into data anonymisation. CIKM 2009: 1541-1544 - [c19]Min Li, Xiaoxun Sun, Hua Wang, Yanchun Zhang:
Optimal Privacy-Aware Path in Hippocratic Databases. DASFAA 2009: 441-455 - [c18]Xiaoxun Sun, Hua Wang, Jiuyong Li, David Ross:
Achieving P-Sensitive K-Anonymity via Anatomy. ICEBE 2009: 199-205 - [c17]William Yeoh, Xiaoxun Sun, Sven Koenig:
Trading Off Solution Quality for Faster Computation in DCOP Search Algorithms. IJCAI 2009: 354-360 - [c16]Xiaoxun Sun, William Yeoh, Sven Koenig:
Efficient Incremental Search for Moving Target Search. IJCAI 2009: 615-620 - [c15]Xiaoxun Sun, Hua Wang, Lili Sun:
Extended K-Anonymity Models Against Attribute Disclosure. NSS 2009: 130-136 - 2008
- [j1]Xiaoxun Sun, Hua Wang, Jiuyong Li, Traian Marius Truta:
Enhanced P-Sensitive K-Anonymity Models for Privacy Preserving Data Publishing. Trans. Data Priv. 1(2): 53-66 (2008) - [c14]Xiaoxun Sun, Hua Wang, Jiuyong Li, Traian Marius Truta, Ping Li:
(p+, α)-sensitive k-anonymity: A new enhanced privacy protection model. CIT 2008: 59-64 - [c13]Xiaoxun Sun, Min Li, Hua Wang, Ashley W. Plank:
An efficient hash-based algorithm for minimal k-anonymity. ACSC 2008: 101-107 - [c12]Xiaoxun Sun, Hua Wang, Jiuyong Li:
On the Complexity of Restricted k-anonymity Problem. APWeb 2008: 287-296 - [c11]Xiaoxun Sun, Sven Koenig, William Yeoh:
Generalized Adaptive A*. AAMAS (1) 2008: 469-476 - [c10]William Yeoh, Sven Koenig, Xiaoxun Sun:
Trading off solution cost for smaller runtime in DCOP search algorithms. AAMAS (3) 2008: 1445-1448 - [c9]Xiaoxun Sun, Hua Wang, Jiuyong Li:
L-Diversity Based Dynamic Update for Large Time-Evolving Microdata. Australasian Conference on Artificial Intelligence 2008: 461-469 - [c8]Xiaoxun Sun, Hua Wang, Jiuyong Li:
Priority Driven K-Anonymisation for Privacy Protection. AusDM 2008: 73-78 - 2007
- [c7]Sven Koenig, Maxim Likhachev, Xiaoxun Sun:
Speeding up moving-target search. AAMAS 2007: 188 - [c6]Qizhi Fang, Rudolf Fleischer, Jian Li, Xiaoxun Sun:
Algorithms for Core Stability, Core Largeness, Exactness, and Extendability of Flow Games. COCOON 2007: 439-447 - [c5]Xiaoxun Sun, Marek J. Druzdzel, Changhe Yuan:
Dynamic Weighting A* Search-Based MAP Algorithm for Bayesian Networks. IJCAI 2007: 2385-2390 - [c4]Xiaoxun Sun, Sven Koenig:
The Fringe-Saving A* Search Algorithm - A Feasibility Study. IJCAI 2007: 2391-2397 - 2006
- [c3]Xiaoxun Sun, Marek J. Druzdzel, Changhe Yuan:
Dynamic Weighting A* Search-based MAP Algorithm for Bayesian Networks. Probabilistic Graphical Models 2006: 279-286 - [c2]Xiaotie Deng, Qizhi Fang, Xiaoxun Sun:
Finding nucleolus of flow game. SODA 2006: 124-131 - 2005
- [c1]Xiaoxun Sun, Qizhi Fang:
Core Stability of Flow Games. CJCDGCGT 2005: 189-199
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 2024-10-07 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint