We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...
0-stable 0-categorical linked quaternionic mappings are studied and are shown to correspond (in some sense) to special groups which are 0stable, 0-categorical, satisfy AP(3) and ha...
: Web searching techniques have been investigated and implemented in many aspects. Particularly, in case of personalization, more important issue is how to manipulate the results r...
Chonggun Kim, JaeYoun Jung, Hyeon-Cheol Zin, Jason...
A complete set of frequent itemsets can get undesirably large due to redundancy when the minimum support threshold is low or when the database is dense. Several concise representat...
In streamwise feature selection, new features are sequentially considered for addition to a predictive model. When the space of potential features is large, streamwise feature sel...
Jing Zhou, Dean P. Foster, Robert A. Stine, Lyle H...