We present and analyze two algorithms for computing the Hilbert class polynomial HD. The first is a p-adic lifting algorithm for inert primes p in the order of discriminant D < ...
Let G be a graph. A vertex labeling of G is distinguishing if the only label-preserving automorphism of G is the identity map. The distinguishing number of G, D(G), is the minimum...
Abstract. A new algorithm is presented for finding genotype-phenotype association rules from data related to complex diseases. The algorithm was based on Genetic Algorithms, a tech...
Vanessa Aguiar, Jose A. Seoane, Ana Freire, Cristi...
A multi-level hierarchical content organization and on-demand delivery framework is presented in this paper. This framework enables engineering content representation and exchange...
Xiaoyong Su, Chi-Cheng Peter Chu, B. S. Prabhu, Ra...
The authors look at online tip exchanges as parts of gift economies created by the players and designers of console and online role-playing games in Taiwan. A group of experienced...