3 citations · 9 across the 9 of their papers we have counts for
9 papers
Efficient Additions and Montgomery Reductions of Large Integers for SIMD
Pengchang Ren, Reiji Suda, Vorapong Suppakitpaisarn
This paper presents efficient algorithms, designed to leverage SIMD for performing Montgomery reductions and additions on integers larger than 512 bits. The existing algorithms enc…
Worst-Case Analysis of LPT Scheduling on Small Number of Non-Identical Processors
Takuto Mitsunobu, Reiji Suda, Vorapong Suppakitpaisarn
The approximation ratio of the longest processing time (LPT) scheduling algorithm has been studied in several papers. While the tight approximation ratio is known for the case when…
Train-by-Reconnect: Decoupling Locations of Weights from their Values
Yushi Qiu, Reiji Suda
What makes untrained deep neural networks (DNNs) different from the trained performant ones? By zooming into the weights in well-trained DNNs, we found it is the location of weight…
Analysis Of The Girth For Regular Bi-partite Graphs With Degree 3
Vivek S Nittoor, Reiji Suda
The goal of this paper is to derive the detailed description of the Enumeration Based Search Algorithm from the high level description provided in [16], analyze the experimental re…
Enumeration Based Search Algorithm For Finding A Regular Bi-partite Graph Of Maximum Attainable Girth For Specified Degree And Number Of Vertices
Vivek S Nittoor, Reiji Suda
We introduce a search problem for finding a regular bi-partite graph of maximum attainable girth for specified degree and number of vertices, by restricting the search space using…
Partition Parameters for Girth Maximum (m, r) BTUs
Vivek S. Nittoor, Reiji Suda
This paper describes the calculation of the optimal partition parameters such that the girth maximum (m, r) Balanced Tanner Unit lies in family of BTUs specified by them using a se…