default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBin Xu 0009
Person information
- affiliation: University of Notre Dame, Notre Dame, IN, USA
Other persons with the same name
- Bin Xu — disambiguation page
- Bin Xu 0001
![[0000-0003-3040-4391]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0003-3040-4391")
— Tsinghua University, Beijing, China - Bin Xu 0002 — Cornell University, Ithaca, NY, USA
- Bin Xu 0003 — Northwestern Polytechnical University, School of Automation, Xi'an, China (and 1 more)
- Bin Xu 0004 — Zhejiang Gongshang University, Hangzhou, China
- Bin Xu 0005 — Zhejiang University, Zhejiang Provincial Key Laboratory of Service Robot, Hangzhou, China
- Bin Xu 0006 — Zhejiang University, Experimental Social Science Laboratory, Hangzhou, China (and 1 more)
- Bin Xu 0007 — Virginia Tech, Blacksburg, VA, USA
- Bin Xu 0008 — Chinese Academy of Agricultural Sciences, Institute of Natural Resources & Regional Planning, Beijing, China
- Bin Xu 0010 — Northeastern University, Shenyang, Liaoning, China
- Bin Xu 0011 — University of Liège, Department of Physics, Belgium
- Bin Xu 0012 — Shanghai University of Engineering Science, School of Mechanical Engineering, China
- Bin Xu 0013 — Soochow University, School of Urban Rail Transportation, Suzhou, China
- Bin Xu 0014 — Nanjing University of Posts and Telecommunications, School of Internet of Things, China
- Bin Xu 0015 — University of Manchester, UK
- Bin Xu 0016 — Massachusetts Institute of Technology, Cambridge, MA, USA
- Bin Xu 0017 — China Meteorological Administration, National Meteorological Information Center, Beijing, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
[j2]Danny Z. Chen, Mark A. Healy, Chao Wang, Bin Xu:
Geometric Algorithms for the Constrained 1-d k-Means Clustering Problems and IMRT Applications. Int. J. Found. Comput. Sci. 20(2): 361-377 (2009)- 2007
- [c6]Danny Z. Chen, Mark A. Healy, Chao Wang, Bin Xu:
Geometric Algorithms for the Constrained 1-D K -Means Clustering Problems and IMRT Applications. FAW 2007: 1-13 - [c5]Bin Xu, Danny Z. Chen:
Density-Based Data Clustering Algorithms for Lower Dimensions Using Space-Filling Curves. PAKDD 2007: 997-1005 - 2005
- [j1]Danny Z. Chen, Michiel H. M. Smid, Bin Xu:
Geometric Algorithms for Density-based Data Clustering. Int. J. Comput. Geom. Appl. 15(3): 239-260 (2005) - 2003
- [c4]Danny Z. Chen, Bin Xu:
Geometric Algorithms for Agglomerative Hierarchical Clustering. COCOON 2003: 30-39 - 2002
- [c3]Danny Z. Chen, Michiel H. M. Smid, Bin Xu:
Geometric Algorithms for Density-Based Data Clustering. ESA 2002: 284-296 - 2000
- [c2]Bin Xu, Danny Z. Chen, Robert J. Szczerba:
Determining optimal paths in a weighted and dynamic 2D environment using framed-octrees. Agents 2000: 29-30 - [c1]Bin Xu, Danny Z. Chen, Robert J. Szczerba:
A new algorithm and simulation for computing optimal paths in a dynamic and weighted 2-D environment. SMC 2000: 313-318
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-11-19 21:45 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:
