Topic
Sign (mathematics)
About: Sign (mathematics) is a research topic. Over the lifetime, 16081 publications have been published within this topic receiving 143076 citations.
Papers published on a yearly basis
Papers
More filters
••
TL;DR: The authors place a strong emphasis on the sign and statistical significance of effects, but often there is very little emphasis on substantive and practical significance of the effects, and they focus only on statistical significance.
Abstract: Many researchers and journals place a strong emphasis on the sign and statistical significance of effects—but often there is very little emphasis on the substantive and practical significance of th...
1,315 citations
•
14 Nov 2003
TL;DR: In this paper, an imaging system for a vehicle includes an imaging device having a field of view exteriorly and forward of the vehicle in its direction of travel, and an image processor operable to process the captured images in accordance with an algorithm.
Abstract: An imaging system for a vehicle includes an imaging device having a field of view exteriorly and forward of the vehicle in its direction of travel, and an image processor operable to process the captured images in accordance with an algorithm. The algorithm comprises a sign recognition routine and a character recognition routine. The image processor processes the image data captured by the imaging device to detect signs in the field of view of the imaging device and applies the sign recognition routine to determine a sign type of the detected sign. The image processor is operable to apply the character recognition routine to the image data to determine information on the detected sign. The image processor applies the character recognition routine to the captured images in response to an output of the sign recognition routine being indicative of the detected sign being a sign type of interest.
1,200 citations
••
1,045 citations
••
TL;DR: It is proved that the sign problem is nondeterministic polynomial (NP) hard, implying that a generic solution of the sign problems would also solve all problems in the complexity class NP inPolynomial time.
Abstract: Quantum Monte Carlo simulations, while being efficient for bosons, suffer from the "negative sign problem" when applied to fermions--causing an exponential increase of the computing time with the number of particles. A polynomial time solution to the sign problem is highly desired since it would provide an unbiased and numerically exact method to simulate correlated quantum systems. Here we show that such a solution is almost certainly unattainable by proving that the sign problem is nondeterministic polynomial (NP) hard, implying that a generic solution of the sign problem would also solve all problems in the complexity class NP in polynomial time.
1,025 citations