563 search results - page 69 / 113 » Computing approximate PSD factorizations |
103
Voted
ICPR
2002
IEEE
16 years 3 months ago
2002
IEEE
This paper describes a new approach to neural network implementation of photometric stereo for a rotational object with non-uniform reflectance factor. Three input images are acqu...
124
click to vote
DCC
2008
IEEE
16 years 1 months ago
2008
IEEE
We study the Tardos' probabilistic fingerprinting scheme and show that its codeword length may be shortened by a factor of approximately 4. We achieve this by retracing Tardo...
116
Voted
ISAAC
2003
Springer
15 years 7 months ago
2003
Springer
We propose a new lattice reduction method. Our algorithm approximates shortest lattice vectors up to a factor ≤ (k/6)n/2k and makes use of Grover’s quantum search algorithm. Th...
142
click to vote
RANDOM
1998
Springer
15 years 6 months ago
1998
Springer
We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we x the size of the bins and try to pack the items in the minimum ...
105
click to vote
JSW
2008
15 years 2 months ago
2008
Intermediate COCOMO Model computes effort as a function of program size and a set of cost drivers. Effort adjustment factor (EAF) is calculated using 15 cost drivers. EAF is an imp...