Zobrazeno 1 - 10
of 66
pro vyhledávání: '"Satish Nadathur"'
Autor:
Friesen, Brian, Patwary, Md. Mostofa Ali, Austin, Brian, Satish, Nadathur, Slepian, Zachary, Sundaram, Narayanan, Bard, Deborah, Eisenstein, Daniel J, Deslippe, Jack, Dubey, Pradeep, Prabhat
The nature of dark energy and the complete theory of gravity are two central questions currently facing cosmology. A vital tool for addressing them is the 3-point correlation function (3PCF), which probes deviations from a spatially random distributi
Externí odkaz:
http://arxiv.org/abs/1709.00086
Autor:
Kurth, Thorsten, Zhang, Jian, Satish, Nadathur, Mitliagkas, Ioannis, Racah, Evan, Patwary, Mostofa Ali, Malas, Tareq, Sundaram, Narayanan, Bhimji, Wahid, Smorkalov, Mikhail, Deslippe, Jack, Shiryaev, Mikhail, Sridharan, Srinivas, Prabhat, Dubey, Pradeep
This paper presents the first, 15-PetaFLOP Deep Learning system for solving scientific pattern classification problems on contemporary HPC architectures. We develop supervised convolutional architectures for discriminating signals in high-energy phys
Externí odkaz:
http://arxiv.org/abs/1708.05256
Putting the DRAM on the same package with a processor enables several times higher memory bandwidth than conventional off-package DRAM. Yet, the latency of in-package DRAM is not appreciably lower than that of off-package DRAM. A promising use of in-
Externí odkaz:
http://arxiv.org/abs/1704.02677
Word2vec is a widely used algorithm for extracting low-dimensional vector representations of words. State-of-the-art algorithms including those by Mikolov et al. have been parallelized for multi-core CPU architectures, but are based on vector-vector
Externí odkaz:
http://arxiv.org/abs/1611.06172
Autor:
Patwary, Md. Mostofa Ali, Satish, Nadathur Rajagopalan, Sundaram, Narayanan, Liu, Jialin, Sadowski, Peter, Racah, Evan, Byna, Suren, Tull, Craig, Bhimji, Wahid, Prabhat, Dubey, Pradeep
Computing $k$-Nearest Neighbors (KNN) is one of the core kernels used in many machine learning, data mining and scientific computing applications. Although kd-tree based $O(\log n)$ algorithms have been proposed for computing KNN, due to its inherent
Externí odkaz:
http://arxiv.org/abs/1607.08220
Word2Vec is a widely used algorithm for extracting low-dimensional vector representations of words. It generated considerable excitement in the machine learning and natural language processing (NLP) communities recently due to its exceptional perform
Externí odkaz:
http://arxiv.org/abs/1604.04661
We propose BlackOut, an approximation algorithm to efficiently train massive recurrent neural network language models (RNNLMs) with million word vocabularies. BlackOut is motivated by using a discriminative loss, and we describe a new sampling strate
Externí odkaz:
http://arxiv.org/abs/1511.06909
Autor:
Sundaram, Narayanan, Satish, Nadathur Rajagopalan, Patwary, Md Mostofa Ali, Dulloor, Subramanya R, Vadlamudi, Satya Gautam, Das, Dipankar, Dubey, Pradeep
Given the growing importance of large-scale graph analytics, there is a need to improve the performance of graph analysis frameworks without compromising on productivity. GraphMat is our solution to bridge this gap between a user-friendly graph analy
Externí odkaz:
http://arxiv.org/abs/1503.07241
Autor:
Snoek, Jasper, Rippel, Oren, Swersky, Kevin, Kiros, Ryan, Satish, Nadathur, Sundaram, Narayanan, Patwary, Md. Mostofa Ali, Prabhat, Adams, Ryan P.
Bayesian optimization is an effective methodology for the global optimization of functions with expensive evaluations. It relies on querying a distribution over functions defined by a relatively cheap surrogate model. An accurate model for this distr
Externí odkaz:
http://arxiv.org/abs/1502.05700
Autor:
Krueger, Jens, Kim, Changkyu, Grund, Martin, Satish, Nadathur, Schwalb, David, Chhugani, Jatin, Plattner, Hasso, Dubey, Pradeep, Zeier, Alexander
Publikováno v:
Proceedings of the VLDB Endowment (PVLDB), Vol. 5, No. 1, pp. 61-72 (2011)
Read-optimized columnar databases use differential updates to handle writes by maintaining a separate write-optimized delta partition which is periodically merged with the read-optimized and compressed main partition. This merge process introduces si
Externí odkaz:
http://arxiv.org/abs/1109.6885