代码搜索：sparse
找到约 3,324 项符合「sparse」的源代码
代码结果 3,324
www.eeworm.com/read/312185/3675449
java sparsengram.java
package jboost.examples.ngram;
/**
* This is the class for sparse ngrams, i.e., all ngrams up to a given
* length, including those with wildcards.
*
* @author Rob Schapire (rewritten by Aaron Arv
www.eeworm.com/read/409299/2234934
svn-base sparsevariancestest.m.svn-base
%Test sparse variances code
clear;
rand('state',22);
numExamples = 15;
numFeatures = 10;
tol = 10^-5;
X = rand(numExamples, numFeatures);
Y = sign(rand(numExamples, 1)-0.5);
X =
www.eeworm.com/read/409299/2234937
m sparsevariancestest.m
%Test sparse variances code
clear;
rand('state',22);
numExamples = 15;
numFeatures = 10;
tol = 10^-5;
X = rand(numExamples, numFeatures);
Y = sign(rand(numExamples, 1)-0.5);
X =
www.eeworm.com/read/405754/2285277
c linebrks.c
/*
# proc: fill_line_breaks - takes a sparse set of line points and extends the last point
# proc: to the left of each void through the break.
# proc: interpolate_line_breaks - take
www.eeworm.com/read/379484/2673368
java isparsevector.java
/**
* May 21, 2007
* @author Samuel Halliday, ThinkTank Mathematics Limited
* Copyright ThinkTank Mathematics Limited 2007
*/
package no.uib.cipr.matrix.sparse;
import no.uib.cipr.matrix.Vector;
www.eeworm.com/read/367160/9778483
f slatm2.f
REAL FUNCTION SLATM2( M, N, I, J, KL, KU, IDIST,
$ ISEED, D, IGRADE, DL, DR, IPVTNG, IWORK, SPARSE )
*
* -- LAPACK auxiliary test routine (version 3.1) --
*
www.eeworm.com/read/367160/9778525
f clatm2.f
COMPLEX FUNCTION CLATM2( M, N, I, J, KL, KU, IDIST, ISEED, D,
$ IGRADE, DL, DR, IPVTNG, IWORK, SPARSE )
*
* -- LAPACK auxiliary test routine (version 3.1) --
*
www.eeworm.com/read/205036/15328906
m double.m
function a = double(s)
%DOUBLE Converts sparse tensor to a dense multidimensional array.
%
% See also SPTENSOR, SPTENSOR/FULL.
%
%MATLAB Tensor Toolbox.
%Copyright 2007, Sandia Corporation.
% This
www.eeworm.com/read/200429/15433551
m num_vertices.m
function n=num_vertices(A)
% NUM_VERTICES The number of vertices in a graph.
%
% n = num_vertices(A) returns the number of vertices in graph A.
%
% Example:
% A = sparse(ones(5));
% n =
www.eeworm.com/read/389811/8498300
m makeparitychk.m
function [c, newH] = makeParityChk(dSource, H, strategy)
% Generate parity check vector bases on LDPC matrix H using sparse LU decomposition
%
% dSource : Binary source (0/1)
% H : LDPC ma