Results 1  10
of
277
P=NP
, 2004
"... We’re greatly indebted to Michael Zenzen for many valuable discussions about the P=?NP problem and digital physics. Though the two arguments herein establishing P=NP are for weal or woe Bringsjord’s, Taylor’s astute objections catalyzed crucial refinements. The Clay Mathematics Institute offers a $1 ..."
Abstract
 Add to MetaCart
We’re greatly indebted to Michael Zenzen for many valuable discussions about the P=?NP problem and digital physics. Though the two arguments herein establishing P=NP are for weal or woe Bringsjord’s, Taylor’s astute objections catalyzed crucial refinements. The Clay Mathematics Institute offers a
An Argument for P=NP
"... version of 5.31.05 • blue = new material created in light of a particular commentator • red = new material created in light of 2nd commentator (who claimed that we smuggle in exponentially growing hardware) • purple = latest additions due to our own further research and reflection ∗ We’re greatly in ..."
Abstract
 Add to MetaCart
indebted to Michael Zenzen for many valuable discussions about the P=?NP problem and physics (simpliciter and digital), and to Jim Fahey for discussions about such physics and mixedmode dualdiamond operators in modal logic. The presentation of the core arguments herein to the Spring 2005 edition
EPnP: An Accurate O(n) Solution to the PnP Problem
 INT J COMPUT VIS
, 2008
"... We propose a noniterative solution to the PnP problem—the estimation of the pose of a calibrated camera from n 3Dto2D point correspondences—whose computational complexity grows linearly with n. This is in contrast to stateoftheart methods that are O(n 5) or even O(n 8), without being more ac ..."
Abstract

Cited by 71 (4 self)
 Add to MetaCart
We propose a noniterative solution to the PnP problem—the estimation of the pose of a calibrated camera from n 3Dto2D point correspondences—whose computational complexity grows linearly with n. This is in contrast to stateoftheart methods that are O(n 5) or even O(n 8), without being more
Accurate NonIterative O(n) Solution to the PnP Problem
, 2007
"... We propose a noniterative solution to the PnP problem—the estimation of the pose of a calibrated camera from n 3Dto2D point correspondences—whose computational complexity grows linearly with n. This is in contrast to stateoftheart methods that are O(n 5) or even O(n 8), without being more accu ..."
Abstract

Cited by 56 (8 self)
 Add to MetaCart
We propose a noniterative solution to the PnP problem—the estimation of the pose of a calibrated camera from n 3Dto2D point correspondences—whose computational complexity grows linearly with n. This is in contrast to stateoftheart methods that are O(n 5) or even O(n 8), without being more
A Linear Method for the PnP Problem
"... Received 20011120; Accepted 20020610 Wu FC, Hu ZY. A linear method for the PnP problem. Journal of Software, 2003,14(3):682~688. Abstract: The classical PnP problem (3≤n≤5) is inherently nonlinear and generally of multiple solutions and sensitive to errors associated with image points. In the c ..."
Abstract
 Add to MetaCart
Received 20011120; Accepted 20020610 Wu FC, Hu ZY. A linear method for the PnP problem. Journal of Software, 2003,14(3):682~688. Abstract: The classical PnP problem (3≤n≤5) is inherently nonlinear and generally of multiple solutions and sensitive to errors associated with image points
Leveraging Feature Uncertainty in the PnP Problem
"... We propose a realtime and accurate solution to the PerspectivenPoint (PnP) problem –estimating the pose of a calibrated camera from n 3Dto2D point correspondences– that exploits the fact that in practice the 2D position of not all 2D features is estimated with the same accuracy. Assuming a mod ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We propose a realtime and accurate solution to the PerspectivenPoint (PnP) problem –estimating the pose of a calibrated camera from n 3Dto2D point correspondences– that exploits the fact that in practice the 2D position of not all 2D features is estimated with the same accuracy. Assuming a
Solving the P/NP Problem under Intrinsic Uncertainty
, 811
"... Heisenberg’s uncertainty principle states that it is not possible to compute both the position and momentum of an electron with absolute certainty. However, this computational limitation, which is central to quantum mechanics, has no counterpart in theoretical computer science. Here, I will show tha ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
will also show that all traditional hard decision problems have polynomialtime algorithms that provide solutions with confidence under uncertainty. 1
PNP03 Recent problems in plasma astrophysics. The heliosphere ∗
"... As 2007 is the international heliospheric year, the present contribution to astroplasma physics is focused on some of the tasks and unresolved problems of heliospheric physics. Especially phenomena of the solar interior, solar atmosphere, solar wind, planets, moons and comets as well as the transit ..."
Abstract
 Add to MetaCart
As 2007 is the international heliospheric year, the present contribution to astroplasma physics is focused on some of the tasks and unresolved problems of heliospheric physics. Especially phenomena of the solar interior, solar atmosphere, solar wind, planets, moons and comets as well
PNP: Mining of Profile Navigational Patterns
"... ABSTRACT Web usage mining is a key knowledge discovery research and as such has been well researched. So far, this research has focused mainly on databases containing access log data only. However, many realworld databases contain users profile data and current solutions for this situation are sti ..."
Abstract
 Add to MetaCart
the concept of profile navigation patterns, which discusses the problem of relating user profile information to navigation behavior. An
A Counterexample to a Proposed Proof of P=NP
, 2008
"... In [1], the claim is put forth that P=NP; the form of this claim is an algorithm which purportedly can solve the 3SAT problem in O(n 4) time. The 3SAT problem (or “3SAT problem, ” as it is refered to in [1]) is to determine if the formula d1 ∧ d2 ∧ · · · ∧ dm (1) is satisfiable, where each clau ..."
Abstract
 Add to MetaCart
In [1], the claim is put forth that P=NP; the form of this claim is an algorithm which purportedly can solve the 3SAT problem in O(n 4) time. The 3SAT problem (or “3SAT problem, ” as it is refered to in [1]) is to determine if the formula d1 ∧ d2 ∧ · · · ∧ dm (1) is satisfiable, where each
Results 1  10
of
277