Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLixin Fu 0001
Person information
- affiliation: The University of North Carolina at Greensboro, NC, USA
- affiliation (former): University of Florida, Gainesville, FL, USA
Other persons with the same name
- Lixin Fu — disambiguation page
- Lixin Fu 0002 — Harbin Institute of Technology, Robotics Institute, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2007
[j5]Lixin Fu, Hamid R. Nemati, Fereidoon Sadri:
Privacy-Preserving Data Mining and the Need for Confluence of Research and Practice. Int. J. Inf. Secur. Priv. 1(1): 47-63 (2007)- 2006
- [j4]Wen-Chen Hu, Jyh-haw Yeh, Lixin Fu, Hung-Jen Yang:
Handheld Computing and Programming for Mobile Commerce. Int. J. Web Inf. Syst. 2(3/4): 164-175 (2006) - 2005
- [j3]Lixin Fu:
Novel Efficient Classifiers Based on Data Cube. Int. J. Data Warehous. Min. 1(3): 15-27 (2005) - 2004
- [j2]Lixin Fu, Sanguthevar Rajasekaran:
Evaluating holistic aggregators efficiently for very large datasets. VLDB J. 13(2): 148-161 (2004) - 2003
- [j1]Joachim Hammer, Lixin Fu:
CubiST++: Evaluating Ad-Hoc CUBE Queries Using Statistics Trees. Distributed Parallel Databases 14(3): 221-254 (2003)
Conference and Workshop Papers
- 2022
- [c14]Lixin Fu, Rohith Rangineni:
DL-CNN: Double Layered Convolutional Neural Networks. ICEIS (1) 2022: 281-286 - 2018
- [c13]Lixin Fu:
A Comprehensive Framework for Detecting Sybils and Spammers on Social Networks. ICEIS (1) 2018: 229-236 - 2017
- [c12]Lixin Fu:
Shortest path deliveries using density-based clustering. ICDIM 2017: 21-26 - 2016
- [c11]Lixin Fu, Juraj Jarabek:
Optimizations for Multiple Collective Sources in Delivery Systems. WI 2016: 461-464 - [c10]Lixin Fu:
A Recommendation System Using OLAP Approach. WI 2016: 622-625 - 2015
- [c9]Lixin Fu, Jing Deng:
ROBE - Knitting a Tight Hub for Shortest Path Discovery in Large Social Graphs. ICEIS (1) 2015: 97-107 - 2013
- [c8]Lixin Fu, Jing Deng:
Graph Calculus: Scalable Shortest Path Analytics for Large Social Graphs through Core Net. Web Intelligence 2013: 417-424 - 2008
- [c7]Bruce Kirchoff, David Remington, Lixin Fu, Fereidoon Sadri:
A New Type of Image-Based Key. BMEI (1) 2008: 825-829 - 2005
- [c6]Lixin Fu:
Construction of Decision Trees Using Data Cube. ICEIS (2) 2005: 119-126 - 2004
- [c5]Lixin Fu:
Efficient Evaluation of Sparse Data Cubes. WAIM 2004: 336-345 - 2002
- [c4]Lixin Fu:
Querying and Clustering Very Large Data Sets Using Dynamic Bucketing Approach. WAIM 2002: 279-290 - 2001
- [c3]Joachim Hammer, Lixin Fu:
Improving the Performance of OLAP Queries Using Families of Statistics Trees. DaWaK 2001: 274-283 - [c2]Lixin Fu, Sanguthevar Rajasekaran:
Novel Algorithms for Computing Medians and Other Quantiles of Disk-Resident Data. IDEAS 2001: 145-154 - 2000
- [c1]Lixin Fu, Joachim Hammer:
CUBIST: A New Algorithm For Improving the Performance of Ad-hoc OLAP Queries. DOLAP 2000: 72-79
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-04-21 17:08 CEST 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:
