Source Code Online Home Categories Top Code New Code Submit Code
Code Directory
 Visual Basic & VB.NET
New Code
Code Line Counter Pro - Delphi Version 6.3
XYZ Shopping Cart 1.0
Faxmind Server
Oracle Data Access Components 9.5
dbExpress driver for Oracle 6.5
Readymade Cms Script 1.04
Select Your College Script 1.04
Wedding Invitation Script 1.04
dbExpress driver for MySQL 6.5
dbExpress driver for PostgreSQL 3.5
Just Dial clone script 1.04
TechnoRiverStudio Professional 8.12
SQL Server Data Access Components 6.11
dbExpress driver for InterBase 4.5
Hotel Reservation Script 1.04
Top Code
PAM HYIP script software 1.0
DTM Data Generator for JSON 1.00.01
OpenWire Studio Beta2
SignalLab VC++ 5.0.3
PlotLab VC++ 5.0.3
InstrumentLab VC++ 5.0.3
BasicVideo VC++ 5.0.3
Contest Software - Agriya v2.0b2
AudioLab VC++ 5.0.3
VideoLab .NET 6.0
SignalLab .NET 6.0
PlotLab .NET 6.0
IntelligenceLab .NET 6.0
InstrumentLab .NET 6.0
BasicVideo.NET 6.0
Top Search
Source Code Of Add Comment In Php
Photo Add Comment Php
Add Comment Script
Comments And Ratings
Php Flatfile Gallery
Phorum Zend
Film Strip Gallery
Dirty Word
Carpooling Website Php
Php Guestbook Submit Picture
Banned Dekaron
Photo Gallery Comment Php
Final Year Computer Science Projects
Vb Mini Projects
Eroso Em Imagens B
Related Search
Point Blank Cheat Unlimited Hp N Ammo By Efouelkei
Point Blank Cheat Unlimited Hp N
Point Blank Cheat Unlimited Hp
Point Blank Cheat Unlimited
Point Blank Cheat Chas Unlimited
Point Blank Cheat
Point Blank Cheat Codes
Point Blank Cheat Point And Cash
Point Blank Cheat Poi
Point Blank Cheat Cash
Point Blank Cheat Point
Point Blank Cheat Mi Cash
Full Cash Point Point Blank Cheat
Point Blank Cheat Mi Cash - Cached
Point Blank Cheat Damage
 Point Blank Cheat Unlimited Hp N Ammo By Efouelkei 

Code 1-20 of 60   Pages: Go to  1  2  3  Next >>  page  

IDX = OTSU(I,N) segments the image I into N classes by means of Otsu's N-thresholding method. OTSU returns an array IDX containing the cluster indices (from 1 to N) of each point.

IDX = OTSU(I) uses two classes (N=2, default value).

[IDX,sep] = OTSU(I,N) also returns the value (sep) of the separability criterion within the range [0 1]. Zero is obtained only with data having less than N values, whereas one (optimal...

TD Forum is a full featured discussion board that supports unthreaded type of discussions on the board. This message board is capable of creating unlimited number of buddies by assigning special graphics, HTML codes and taglines. Admin is...

This is a java script where the users are allowed to upload unlimited number of files by browsing directories. This program provide control for the users files by getting connected with the FTP server. Features like specifying the / directory to...

TBiancoGlobe is a very simple GraphicControl that allow you to see a 3D ball. Setting the position repeatatly you could get a nice rotating effect. You can add points N everywhere by setting X, Y position and color.

This is project is a refactoring assistant kit. It intends to provide tools and script to help refactor C++ code, replacing our usual search'n'replace by providing some rough code analysis and IDE specific plug-ins for integration.

This function returns N point DFT samples of 2dw band of Fourier transform of a sequence. Typically, fft() returns N samples of Fourier transform ranging from 0 to 2pi. This function takes the N-point DFT samples and returns N-point samples...

NUMREGPOLY Number of Intersection Points and Regions Made By The Diagonals of a Regular Polygon

[A,B,I,R]=numregpoly(N) for integer n returns the following:

A: Vector of number of points inside the regular n-gon other than...

[cout,hout] = trisurfc(xin,yin,zin,N)

Regularly just called by with the following syntax to produce a plot:
Where xin,yin,zin are 1-D arrays of the x,y,z triples of the points in your mesh.

Y = INPAINTN(X) replaces the missing data in X by extra/interpolating the non-missing elements. The non finite values (NaN or Inf) in X are considered as missing data. X can be any N-D array.

Important note:

Finds a knee point of a curve
Finds a location of "knee" of a curve. Provides a consistent and mathematically justifiable answer when there is no obvious location along the curve where the curve "turns". The function uses...

DIJKSTRA Calculate Minimum Costs and Paths using Dijkstra's Algorithm

[AorV] Either A or V where
A is a NxN adjacency matrix, where A(I,J) is nonzero if and only if an edge connects point I to point J

MAT = NPERMUTEK(N,K) returns all possible permutations of the elements taken from vector N of length K. This type of sampling is an ordered sample with replacement.
This is also known as the permutations with repetition.
MAT has size...

This submission contains VERT2LCON and LCON2VERT, which will find the linear constraints defining a bounded polyhedron in R^n, given its vertices, or vice versa. They are extensions of Michael Kleder's VERT2CON and CON2VERT functions that can...

Gaussian kernel regression and local linear Gaussian kernel regression with variable window width
This is the same as ksr and ksrlin (file File ID: #19195 and #19564), but instead of using the same bandwidth for each point, it uses a variable...

HISTCND is similar to HISTC, but creates a histogram with any number of dimensions.


where N is a histogram count with dimensions
length(XEDGES) x length(YEDGES) x...

Savitzky-Golay Smoothing and Differentiation Filter
The Savitzky-Golay smoothing/differentiation filter (i.e., the polynomial smoothing/differentiation filter,
or the least-squares smoothing/differentiation filters)...

Intended for 3D geological/geophysical visualisation of layered data and will eventually form part of a geophysical visualisation package.
Run ThreedDemo to get an idea of how to use.

INPUTS: LayerN: The number of the layer to be...

Motion systems are widely used in industry; for instance for robotics and pick-and place units. In most cases they are characterized by a repetitive motion or sequence of motions between fixed positions. The actuator, or motor, is limited in speed...

I explored different options for realtime audio input (see below for a summary) before having to settling for this option. Unfortunately this solution requires Windows and the Data Acquisition toolbox. I hope to be able to report at some point...

Let MyFunction(z) to be a complex valued function of the complex argument z.
Let z0 to be the initial point from which the search procedure starts.
by doing a projection on the hyperspace (a line in the real case) defined by two...