Institution
New York University
Education•New York, New York, United States•
About: New York University is a education organization based out in New York, New York, United States. It is known for research contribution in the topics: Population & Poison control. The organization has 72380 authors who have published 165545 publications receiving 8334030 citations. The organization is also known as: NYU & University of the City of New York.
Topics: Population, Poison control, Context (language use), Health care, Cancer
Papers published on a yearly basis
Papers
More filters
••
TL;DR: This minireview discusses physiological bone remodeling, outlining the traditional bone biology dogma in light of emerging osteoimmunology data, including events that orchestrate the five sequential phases of bone remodelling.
1,114 citations
••
TL;DR: The ring-LWE distribution is pseudorandom as discussed by the authors, assuming that worst-case problems on ideal lattices are hard for polynomial-time quantum algorithms, which is not the case.
Abstract: The “learning with errors” (LWE) problem is to distinguish random linear equations, which have been perturbed by a small amount of noise, from truly uniform ones. The problem has been shown to be as hard as worst-case lattice problems, and in recent years it has served as the foundation for a plethora of cryptographic applications. Unfortunately, these applications are rather inefficient due to an inherent quadratic overhead in the use of LWE. A main open question was whether LWE and its applications could be made truly efficient by exploiting extra algebraic structure, as was done for lattice-based hash functions (and related primitives).We resolve this question in the affirmative by introducing an algebraic variant of LWE called ring-LWE, and proving that it too enjoys very strong hardness guarantees. Specifically, we show that the ring-LWE distribution is pseudorandom, assuming that worst-case problems on ideal lattices are hard for polynomial-time quantum algorithms. Applications include the first truly practical lattice-based public-key cryptosystem with an efficient security reduction; moreover, many of the other applications of LWE can be made much more efficient through the use of ring-LWE.
1,114 citations
•
TL;DR: The ROC convex hull (ROCCH) method as mentioned in this paper combines techniques from ROC analysis, decision analysis and computational geometry, and adapts them to the particulars of analyzing learned classifiers.
Abstract: In real-world environments it usually is difficult to specify target operating conditions precisely, for example, target misclassification costs. This uncertainty makes building robust classification systems problematic. We show that it is possible to build a hybrid classifier that will perform at least as well as the best available classifier for any target conditions. In some cases, the performance of the hybrid actually can surpass that of the best known classifier. This robust performance extends across a wide variety of comparison frameworks, including the optimization of metrics such as accuracy, expected cost, lift, precision, recall, and workforce utilization. The hybrid also is efficient to build, to store, and to update. The hybrid is based on a method for the comparison of classifier performance that is robust to imprecise class distributions and misclassification costs. The ROC convex hull (ROCCH) method combines techniques from ROC analysis, decision analysis and computational geometry, and adapts them to the particulars of analyzing learned classifiers. The method is efficient and incremental, minimizes the management of classifier performance data, and allows for clear visual comparisons and sensitivity analyses. Finally, we point to empirical evidence that a robust hybrid classifier indeed is needed for many real-world problems.
1,114 citations
••
TL;DR: In this paper, a variational network approach is proposed to reconstruct the clinical knee imaging protocol for different acceleration factors and sampling patterns using retrospectively and prospectively undersampled data.
Abstract: PURPOSE To allow fast and high-quality reconstruction of clinical accelerated multi-coil MR data by learning a variational network that combines the mathematical structure of variational models with deep learning. THEORY AND METHODS Generalized compressed sensing reconstruction formulated as a variational model is embedded in an unrolled gradient descent scheme. All parameters of this formulation, including the prior model defined by filter kernels and activation functions as well as the data term weights, are learned during an offline training procedure. The learned model can then be applied online to previously unseen data. RESULTS The variational network approach is evaluated on a clinical knee imaging protocol for different acceleration factors and sampling patterns using retrospectively and prospectively undersampled data. The variational network reconstructions outperform standard reconstruction algorithms, verified by quantitative error measures and a clinical reader study for regular sampling and acceleration factor 4. CONCLUSION Variational network reconstructions preserve the natural appearance of MR images as well as pathologies that were not included in the training data set. Due to its high computational performance, that is, reconstruction time of 193 ms on a single graphics card, and the omission of parameter tuning once the network is trained, this new approach to image reconstruction can easily be integrated into clinical workflow. Magn Reson Med 79:3055-3071, 2018. © 2017 International Society for Magnetic Resonance in Medicine.
1,111 citations
••
TL;DR: A post-processing technique for fast denoising of diffusion-weighted MR images is introduced and it is demonstrated that the technique suppresses local signal fluctuations that solely originate from thermal noise rather than from other sources such as anatomical detail.
1,110 citations
Authors
Showing all 73237 results
Name | H-index | Papers | Citations |
---|---|---|---|
Rob Knight | 201 | 1061 | 253207 |
Virginia M.-Y. Lee | 194 | 993 | 148820 |
Frank E. Speizer | 193 | 636 | 135891 |
Stephen V. Faraone | 188 | 1427 | 140298 |
Eric R. Kandel | 184 | 603 | 113560 |
Andrei Shleifer | 171 | 514 | 271880 |
Eliezer Masliah | 170 | 982 | 127818 |
Roderick T. Bronson | 169 | 679 | 107702 |
Timothy A. Springer | 167 | 669 | 122421 |
Alvaro Pascual-Leone | 165 | 969 | 98251 |
Nora D. Volkow | 165 | 958 | 107463 |
Dennis R. Burton | 164 | 683 | 90959 |
Charles N. Serhan | 158 | 728 | 84810 |
Giacomo Bruno | 158 | 1687 | 124368 |
Tomas Hökfelt | 158 | 1033 | 95979 |