代码搜索:L
找到约 10,000 项符合「L」的源代码
代码结果 10,000
www.eeworm.com/read/423346/10569337
lst lm032l4l.lst
MPASM 00.00.68 Intermediate LM032L.ASM 6-8-1994 5:29:26 PAGE 1
LOC OBJECT CODE LINE SOURCE TEXT
0001 LIST P=16C64, F=INHX8M
www.eeworm.com/read/270913/11022371
tdf altsyncram_l4l1.tdf
--altsyncram ADDRESS_REG_B="CLOCK1" BYTE_SIZE=8 CBX_DECLARE_ALL_CONNECTED_PORTS="OFF" CLOCK_ENABLE_INPUT_A="NORMAL" CLOCK_ENABLE_INPUT_B="NORMAL" CYCLONEII_M4K_COMPATIBILITY="ON" CYCLONEII_SAFE_WRITE=
www.eeworm.com/read/457742/7318196
m l2l1_resection.m
function [P,itercount] = l2l1_resection(xm, Xlist, optim_bound, beta, maxiter)
fprintf('\n\n******** Starting (L2,L1) Resectioning Algorithm ********\n\n');
nbrpoints = size(Xlist,2);
nbrimages = 1;
www.eeworm.com/read/457742/7318198
m l2l1_triangulation.m
function [U,itercount] = l2l1_triangulation(u, P, optim_bound, beta, maxiter)
fprintf('\n\n******** Starting (L2,L1) Triangulation Algorithm ********\n\n');
alphaval = 0.5;
opts.autoinit
www.eeworm.com/read/457742/7318211
m l1l1_triangulation.m
%function [U,itercount,eot,solution,opts] = l1l1_triangulation(P,u,U0);
function [U,itercount,eot,solution,opts] = l1l1_triangulation(u,P,epsilon,delta,maxiter)
fprintf('\n\n******** Starting (L1,L
www.eeworm.com/read/457742/7318218
m l1l1_resection.m
function [P,itercount,solution,opts] = l1l1_resection(u,U,epsilon,delta,maxiter)
fprintf('\n\n******** Starting (L1,L1) Resectioning Algorithm ********\n\n');
if nargin < 3;
epsilon = 0.95;
www.eeworm.com/read/457742/7318225
m l2l2_resection.m
function [H,iter]=l2l2_resection(u,U,epsperc,maxerror,maxiter);
% Computes optimal homography or projection matrix of size (m+1)x(n+1), where m
www.eeworm.com/read/457742/7318228
m l2l2_triangulation.m
function [U,iter]=l2l2_triangulation(u,P,epsperc,maxerror,maxiter);
%input u,P
fprintf('\n\n******** Starting (L2,L2) Triangulation Algorithm ********\n\n');
nbrimages=length(P);
%epsdiff=1e
www.eeworm.com/read/398582/7935773
m demo_l2_l1.m
function demo_l2_l1
% demo_l2_l1 - This demo illustrates the TwIST
% algorithms in the l2-l1 optimization problem
%
% xe = arg min 0.5*||A x-y||^2 + tau ||x||_1
% x
%
% whe
www.eeworm.com/read/398582/7935835
m demo_l2_l0.m
function demo_l2_l0
% demo_l2_l0 - This demo illustrates the TwIST algorithm in
% the l2-l0 optimization problem
%
% xe = arg min 0.5*||A x-y||^2 + tau ||x||_0
% x
%
% whi