代码搜索：sparse
找到约 3,324 项符合「sparse」的源代码
代码结果 3,324
www.eeworm.com/read/205036/15328860
m nvecs.m
function u = nvecs(t,n,r,opts)
%NVECS Compute the leading mode-n vectors for a sparse tensor.
%
% U = NVECS(X,n,r) computes the r leading eigenvalues of Xn*Xn'
% (where Xn is the mode-n matricizat
www.eeworm.com/read/379728/9180277
cpp subtract_mu.cpp
// SUBTRACT_MU.CPP
//
// X = SUBTRACT_MU( X, Mu ) subtracts bias term Mu from sparse data
// matrix X.
// Equivalent Matlab code:
// M = spones(X);
// X = X - repmat(Mu,1,size(X,2)).*M;
// This
www.eeworm.com/read/452180/7446307
m edge_index_example.m
load ../graphs/bfs_example.mat
[i,j,val] = find(A);
% assign a randon number to each edge in the graph
edge_rand = rand(num_edges(A),1);
Av = sparse(i,j,edge_rand, size(A,1), size(A,2));
www.eeworm.com/read/241310/13157660
changelo
Mon Jul 1 14:14:06 1991 Michael I Bushnell (mib at geech.gnu.ai.mit.edu)
* Release of version 1.10; appropriate changes to README.
* create.c: Removed printf's about sparse files.
* Fix
www.eeworm.com/read/322718/13369750
m xdc_2d_array.m
% Procedure for creating a 2d (sparse) array transducer
%
% Calling: Th = xdc_2d_array (no_ele_x, no_ele_y, width, height, kerf_x, kerf_y,
% enabled, no_sub_x, no_sub
www.eeworm.com/read/314474/13566625
h xcount.h
/*
* XCount.h --
* Sparse integer counts stored in 2 bytes.
*
* Copyright (c) 1995,2005 SRI International. All Rights Reserved.
*
* @(#)$Header: /home/srilm/devel/lm/src/RCS/XCount.h,v 1.4 2006
www.eeworm.com/read/141708/5769323
cc test.cc
#include "scv.h"
#include "packet.h"
SC_MODULE(sctop) {
SC_CTOR(sctop);
};
// nbcode "decl" start
sctop::sctop(sc_module_name name) : sc_module(name)
{
// Create a sparse packet array
packetT
www.eeworm.com/read/347945/11623471
m fixer.m
function [upper1,x_min] = fixer(p,output);
x = output.Primal;
integer = uniquestripped([p.binary_variables p.integer_variables]);
n = length(integer);
Fnew = [round(x(integer)) -sparse(1:n,int
www.eeworm.com/read/347943/11626191
c fwblkslv.c
/*
y = fwblkslv(L,b, [y])
Given block sparse Cholesky structure L, as generated by
SPARCHOL, this solves the equation "L.L * y = b(L.perm,:)",
i.e. y = L.L\b(L.perm,:). The diagonal
www.eeworm.com/read/117582/14913108
cpp vdiskextraw.cpp
/*
VDiskExtRaw.cpp
Raw image file class
Copyright (c) 2003 Ken Kato
*/
#include "vdkbase.h"
#include "vdkutil.h"
#ifdef USE_SPARSE_FILE
#include "SparseFile.h"
#endif
#include "VDisk.h"
#includ