4860 search results - page 64 / 972 » SNPs Problems, Complexity, and Algorithms |
IWPEC
2009
Springer
14 years 2 months ago
2009
Springer
We study the Hospitals/Residents with Couples problem, a variant of the classical Stable Marriage problem. This is the extension of the Hospitals/Residents problem where residents ...
DEXAW
2008
IEEE
14 years 2 months ago
2008
IEEE
Linear Ordering Problem (LOP) is a well know optimization problem attractive for its complexity (it is a NPhard problem), rich collection of testing data and variety of real world...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We study the power of nonadaptive quantum query algorithms, which are algorithms whose queries to the input do not depend on the result of previous queries. First, we show that an...
CVPR
2003
IEEE
14 years 9 months ago
2003
IEEE
An efficient algorithmic solution to the classical five-point relative pose problem is presented. The problem is to find the possible solutions for relative camera motion between ...
ANTS
2006
Springer
13 years 11 months ago
2006
Springer
The discrete logarithm problem (DLP) generalizes to the constrained DLP, where the secret exponent x belongs to a set known to the attacker. The complexity of generic algorithms f...