代码搜索：finding
找到约 1,199 项符合「finding」的源代码
代码结果 1,199
www.eeworm.com/read/437702/7742658
testfile
One technique for improving IR performance is to provide searchers with
ways of finding morphological variants of search terms. If, for example,
a searcher enters the term stemming as part of a que
www.eeworm.com/read/436037/7778584
m houghcircle.m
% houghcircle - takes an edge map image, and performs the Hough transform
% for finding circles in the image.
%
% Usage:
% h = houghcircle(edgeim, rmin, rmax)
%
% Arguments:
% edgeim - the edge
www.eeworm.com/read/435150/7796125
cpp ex4_04.cpp
// Exercise 4.4 Finding the range for an integer.
// This is just a question of bolting sufficent conditional operators together
// in an expression.
#include
using std::cin;
using
www.eeworm.com/read/137285/13334990
c codeeig_var_usg.c
NLNE; printf(" This program inspects alist matrices, finding") ;
NLNE; printf(" the second eigenvalue of the graph \n") ;
NLNE;
DNT; fprintf( fp, "-v verbose (verbose
www.eeworm.com/read/307145/13727630
readme
Chapter 16 - Graphs
The files in this directory make up a simple but versatile library for
manipulating graphs. Algorithms are provided for topological sorting,
finding minimum spanning trees and
www.eeworm.com/read/153018/12066773
m missmult.m
function [X]=missmult(A,B)
%[X]=missmult(A,B)
%This function determines the product of two matrices containing NaNs
%by finding X according to
% X = A*B
%If there are columns in A or B that a
www.eeworm.com/read/217774/14951546
cpp shortcut.cpp
//////////////////////////////////////////////////////////////////////
// Amit's Path-finding (A*) code.
//
// The main items of interest in my code are:
//
// 1. I'm using a hexagonal grid instead o
www.eeworm.com/read/207217/15279276
cpp ex4_04.cpp
// Exercise 4.4 Finding the range for an integer.
// This is just a question of bolting sufficent conditional operators together
// in an expression.
#include
using std::cin;
using
www.eeworm.com/read/478917/1348089
java package-info.java
/**
* This package provides utility classes for finding type information for generic types.
*
* @author Inderjeet Singh, Joel Leitch
*/
package com.google.gson.reflect;
www.eeworm.com/read/199528/5076170
java penaltyconstrainedminimizer.java
package edu.stanford.nlp.optimization;
/**
* A wrapper class which builds a constrained minimizer out of an
* unconstrained one by finding the unconstrained minimum of a
* sequence of penalized su