We present a method for hierarchical data approximation using curved quadratic simplicial elements for domain decomposition. Scientific data defined over two- or three-dimensional ...
Today's data centers offer tremendous aggregate bandwidth to clusters of tens of thousands of machines. However, because of limited port densities in even the highest-end swi...
Mohammad Al-Fares, Sivasankar Radhakrishnan, Barat...
How to rapidly disseminate a large-sized file to many recipients is a fundamental problem in many applications, such as updating software patches and distributing large scientific ...
Many classification algorithms use the concept of distance or similarity between patterns. Previous work has shown that it is advantageous to optimize general Euclidean distances (...
Background: Most genomic data have ultra-high dimensions with more than 10,000 genes (probes). Regularization methods with L1 and Lp penalty have been extensively studied in survi...
Zhenqiu Liu, Dechang Chen, Ming Tan, Feng Jiang, R...