代码搜索:Approximate

找到约 1,048 项符合「Approximate」的源代码

代码结果 1,048
www.eeworm.com/read/304962/3782549

h approximate_min_ellipsoid_d_debug.h

// Copyright (c) 1997-2001 ETH Zurich (Switzerland). // All rights reserved. // // This file is part of CGAL (www.cgal.org); you may redistribute it under // the terms of the Q Public License version
www.eeworm.com/read/304962/3782552

h approximate_min_ellipsoid_d_impl.h

// Copyright (c) 1997-2001 ETH Zurich (Switzerland). // All rights reserved. // // This file is part of CGAL (www.cgal.org); you may redistribute it under // the terms of the Q Public License version
www.eeworm.com/read/304962/3782553

h approximate_min_ellipsoid_d_configure.h

// Copyright (c) 1997-2001 ETH Zurich (Switzerland). // All rights reserved. // // This file is part of CGAL (www.cgal.org); you may redistribute it under // the terms of the Q Public License version
www.eeworm.com/read/362213/10012630

m ex2_6.m

% Example 2.6 % R = 1; C = 1; T = .2; a =-(1-T/R/C); b = [0 T/C]; y0 = 0; x0 = 1; n = 1:40; x = ones(1,length(n)); y1 = recur(a,b,n,x,x0,y0); % approximate solution % compare to exac
www.eeworm.com/read/127249/14364746

html approxstrmat.html

approximate string match
www.eeworm.com/read/142033/12969734

m joint_diag_rc.m

function [ V , qDs ]= joint_diag_rc(A,threshold) % This is Cardoso's slightly modified routine joint_diag_r.m % (available at http://www.tsi.enst.fr/~cardoso/stuff.html) % % Computes the approxim
www.eeworm.com/read/492905/6413775

bld1

- Introduction bls1: sparse svd via hybrid block Lanczos procedure for equivalent 2-cyclic eigensystems. bls1.c is an ANSI-C code designed to compute singular values and sing
www.eeworm.com/read/492905/6413813

bld2

- Introduction bls2: sparse svd via hybrid block Lanczos procedure for eigensystems of the form A'A. bls2.c is an ANSI-C code designed to compute singular values and singular
www.eeworm.com/read/258845/11838329

chronicle agrep.chronicle

This chronicle briefly describes the progress of agrep. Feb/91: The approximate pattern matching algorithm called 'bitap' (bit-parallel approximate pattern matching) is designed. The algorith
www.eeworm.com/read/367236/9765665

m joint_diag_rc.m

function [ V , qDs ]= joint_diag_rc(A,threshold) % This is Cardoso's slightly modified routine joint_diag_r.m % (available at http://www.tsi.enst.fr/~cardoso/stuff.html) % % Computes the approxim