supported by the Key Program of National Natural Science Foundation of China under Grant No.61732018;the National Natural Science Foundation of China under Grant No.61902415;the Open Foundation of Science and Technology on Parallel and Distributed Laboratory(School of Computer,National University of Defense Technology)under Grant No.6142110190201.
Community detection is a vital task in many fields,such as social networks and financial analysis,to name a few.The Louvain method,the main workhorse of community detection,is a popular heuristic method.To apply it to...
The research was supported by Basic Science Research Program through the National Research Foundation of Korea(NRF)funded by the Ministry of Science,ICT&Future Planning under Grant No.NRF-2019R1A2C2084158;Samsung Electronics Co.Ltd.
Many existing warning prioritization techniques seek to reorder the static analysis warnings such that true positives are provided first. However, excessive amount of time is required therein to investigate and fix pr...
This work was supported by the National Basic Research 973 Program of China under Grant No. 2012CB316201, the National Natural Science Foundation of China under Grant Nos. 61033007 and 61472070, and the Fundamental Research Funds for the Central Universities of China under Grant No. N120816001.
The distance-based outlier is a widely used definition of outlier. A point is distinguished as an outlier on the basis of the distances to its nearest neighbors. In this paper, to solve the problem of outlier computin...
supported by the International Science and Technology Cooperation Program of China under Grant No.2010DFA92720;the National Natural Science Foundation of China under Grant Nos.11271351,60928006,and 61379087
The maximum diameter color-spanning set problem(MaxDCS) is defined as follows: given n points with m colors, select m points with m distinct colors such that the diameter of the set of chosen points is maximized. I...
This paper describes a level-of-detail rendering technique for large-scale irregular volume datasets.It is well known that the memory bandwidth consumed by visibility sorting becomes the limiting factor when carrying ...
This work is supported by NSF of USA under Grant Nos.IIS-0430274, and CCR-0325951, and sponsors of CERIAS;Rui Xue is partially supported by the Fund of the China Scholarship Council, partially by National Natural Science Foundation of China under Grant No.60773029;National Grand Fundamental Research 973 Program of China under Grant No.2007CB311202;the National High Technology Research and Development 863 Program of China under Grant No.2006AA01Z427.
Zero knowledge sets is a new cryptographic primitive introduced by Micali, Rabin, and Kilian in FOCS 2003. It has been intensively studied recently. However all the existing ZKS schemes follow the basic structure by M...
Mining frequent patterns from datasets is one of the key success of data mining research. Currently, most of the studies focus on the data sets in which the elements are independent, such as the items in the marketing...
Several extensions of the logic programming language Prolog to non Horn clauses use case analysis to handle non-Horn clauses. In this paper, analytical and empirical evidences are presented to show that, by making a ...
Two sets are close if their symmetric difference is a sparse set. It is shown that NP-hard sets are not C=P-close unless NP C=C=P. This improves the previous result and has implication in quantum compulation.
The original interpretation of the constructive set theory CZF in Martin-Lof's type theory uses the 'extensional identity types'. It is generally believed that these 'types' do not belong to type theory. In this paper...