نتایج جستجو برای: single step
تعداد نتایج: 1101204 فیلتر نتایج به سال:
High cost of training time caused by multi-step adversarial example generation is a major challenge in training. Previous methods try to reduce the computational burden using single-step schemes, which can effectively improve efficiency but also introduce problem “catastrophic overfitting”, where robust accuracy against Fast Gradient Sign Method (FGSM) achieve nearby 100% whereas Projected Desc...
In this paper, a new algorithm to solve the discrete logarithm problem is presented which is similar to the usual baby-step giant-step algorithm. Our algorithm exploits the order of the discrete logarithm in the multiplicative group of a finite field. Using randomization with parallelized collision search, our algorithm indicates some weakness in NIST curves over prime fields which are consider...
We study the giant magnon solutions in the near horizon geometry of the Neveu-Schwarz (NS) 5-brane background. In conformal gauge, we find magnon dispersion relation in the large angular momentum (J) limit. We further show that the giant magnon poses uniform distribution of the angular momentum along the string world-sheet as in case of AdS5 × S5 spacetime.
Modeling Microdomain Evolution on Giant Unilamellar Vesicles using a Phase-Field Approach by Anand Embar Department of Civil and Environmental Engineering Duke University
Despite common belief, Baby Boomers form a sizable population of gamers. Paying attention to how this generation experiences a game can help companies that target this group of users increase their market share. To address this need, this study examines Baby Boomers’ reaction to a new way of manipulating objects in a game, namely with their eyes. In particular, the study focuses on testing the ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید