2570 search results - page 69 / 514 » Fast Algorithms For The Computation Of Ranklets |
CSDA
2006
14 years 10 months ago
2006
Likelihood-based marginal regression modelling for repeated, or otherwise clustered, categorical responses is computationally demanding. This is because the number of measures nee...
121
click to vote
STOC
1994
ACM
15 years 2 months ago
1994
ACM
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
122
click to vote
QCQC
1998
Springer
15 years 2 months ago
1998
Springer
The quantum Fourier transform (QFT), a quantum analog of the classical Fourier transform, has been shown to be a powerful tool in developing quantum algorithms. However, in classi...
ICARCV
2008
IEEE
15 years 4 months ago
2008
IEEE
—In order to navigate safely, it is important to detect and to react to a potentially dangerous situation. Such a situation can be underlined by a judicious use of the locations ...
115
click to vote
APCCAS
2006
IEEE
14 years 12 months ago
2006
IEEE
The paper presents a hardware friendly fast algorithm and its architecture for motion estimation (ME) in H.264 video coding. The fast algorithm adopts the quarter pel subsampling a...