Search
New Code
Spire.PDF for Java 2.7.8
Database Workbench Pro 5.6.10.0
The C# PDF Library 2020.1.5
CAD-Viewer 3DVBVIEW V4
dotConnect for SQLite 5.15
LuaStudio 9.92
EntityDAC 2.3
Devart ODBC Driver for QuickBooks 2.0
phpEnter 5.1.
Udemy Clone script 2.01
VisualNEO Web 19.11.7
VisualNEO for Windows 19.4.29.0
SentiVeillance SDK Trial 7.3
Devart ODBC Driver for PostgreSQL 3.2
SecureBridge 9.2
Top Code
phpEnter 5.1.
Single Leg MLM 1.2.1
Azizi search engine script PHP 4.1.10
Paste phpSoftPro 1.4.1
Extreme Injector 3.7
Deals and Discounts Website Script 1.0.2
ADO.NET Provider for ExactTarget 1.0
Solid File System OS edition 5.1
Classified Ad Lister 1.0
Aglowsoft SQL Query Tools 8.2
Invoice Manager by PHPJabbers 3.0
ICPennyBid Penny Auction Script 4.0
PHP Review Script 1.0
ATN Resume Finder 2.0
ATN Site Builder 3.0
Code Listing by Sebastien Paris

Code 11-20 of 28   Pages: Go to  << Prior  1  2  3  Next >>  page  






A fast mex version of the modified inpoly function.

please run mexme_inpoly.m to compile mex file on your plateform

please run test_inpoly.m for demo



SAT solvers by Cross-Entropy (CE) and a Botev-Kroeze (BK) optimization algorithms

CNF SAT problems can be formulated as :

S(X)=sum(j=1,...,m)C_j, where C_j=max(0 , (2X_i-1)*Aji

Please run the demo files



Here is another fast implementation of the FGT transform.

Reference :
http://www.cs.ubc.ca/~awll/nbody_methods.html



Multi-Knapsack solver by two stochastic solvers : i) by Cross-Entropy Method and ii) by Botev-Kroese Method for the following problem

max S(X)=(p^{t}X)
st. WX <= c

Please run the demo files :



Return the optimal path given the adjacency/cost sparse matrix and source/destination nodes.

Run mexme_dijkstra.m to compile mex-files on your own-plateform.
Be sure that "mex -setup" have been done at least one.



em_uvp : Expectation-Maximization algorithm for a Univariate Poisson Mixture

[logl , R , P] = em_upm(Z , R0 , P0 , [nbite]);

Inputs
-------

Z Discrete measurements (1 x K x [n1] x ... x [nl])
R0...



Generates random 2D-paths between start and finish nodes according to densities distribution given by matrix C with leg's contrainsts defined by the adjacency matrix I.

P = path_generator(start , finish , I , [C] , [K] , [V] ,...



NDellipse returns 2d coordinates of several ellipsoids defined by NDslices.

Usage [x , y] = ndellipse(M , S , [H] , [R] , [N]);
------

Inputs
-------

M : Mean vector (d x 1 x [n1] , ... , [nl])



A demo illustring Particle filter for navigation with altimetric measurements. Performances of particle filter is compared with the Posterior Cramdodur-Rao Bounds

Please run mexme_pf_nav.m for compiling mex-files on your plateform (be...



Faces detection toolbox v 0.2
-----------------------------

This toolbox provides some tools for faces detection/classification using Local Binary Patterns (and some variants) and Haar features.
Face detection is performed by...