Sciweavers

432 search results - page 69 / 87
» Internally deterministic parallel algorithms can be fast
Sort
View
IPPS
1998
IEEE
15 years 1 months ago
Optimizing Data Scheduling on Processor-in-Memory Arrays
In the study of PetaFlop project, Processor-In-Memory array was proposed to be a target architecture in achieving 1015 floating point operations per second computing performance. ...
Yi Tian, Edwin Hsing-Mean Sha, Chantana Chantrapor...
ICS
2010
Tsinghua U.
14 years 12 months ago
Clustering performance data efficiently at massive scales
Existing supercomputers have hundreds of thousands of processor cores, and future systems may have hundreds of millions. Developers need detailed performance measurements to tune ...
Todd Gamblin, Bronis R. de Supinski, Martin Schulz...
ICML
2009
IEEE
15 years 10 months ago
Large-scale deep unsupervised learning using graphics processors
The promise of unsupervised learning methods lies in their potential to use vast amounts of unlabeled data to learn complex, highly nonlinear models with millions of free paramete...
Rajat Raina, Anand Madhavan, Andrew Y. Ng
ICML
2004
IEEE
15 years 10 months ago
Predictive automatic relevance determination by expectation propagation
In many real-world classification problems the input contains a large number of potentially irrelevant features. This paper proposes a new Bayesian framework for determining the r...
Yuan (Alan) Qi, Thomas P. Minka, Rosalind W. Picar...
WWW
2006
ACM
15 years 10 months ago
Compressing and searching XML data via two zips
XML is fast becoming the standard format to store, exchange and publish over the web, and is getting embedded in applications. Two challenges in handling XML are its size (the XML...
Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini...