Search
Code Directory
 ASP
 ASP.NET
 C/C++
 CFML
 CGI/PERL
 Delphi
 Development
 Flash
 HTML
 Java
 JavaScript
 Pascal
 PHP
 Python
 SQL
 Tools
 Visual Basic & VB.NET
 XML
New Code
.Net VCL for Delphi 1.0.0.0
ASP. NET C# PDF Software 4.5
LinqConnect Professional 4.8
CAD VCL: 2D/3D CAD in Delphi/C++Builder 14
wolfSSL 3.15.7
CAD DLL 14
AnyStock Stock and Financial JS Charts 8.4.2
ODBC Driver for SQLite 2.4
dotConnect for SugarCRM 1.7
dbForge SQL Complete 5.9
dbForge Studio for MySQL 8.0
.Net Runtime Library for Delphi 6.0.4.0
Scimbo 1.64
AnyMap JS Maps 8.4.2
GetOrgChart 2.5.3
Top Code
Paste phpSoftPro 1.4.1
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
ICPennyBid Penny Auction Script 4.0
PHP Review Script 1.0
ATN Resume Finder 2.0
ATN Site Builder 3.0
Availability Booking Calendar PHP 1.0
PHP GZ Blog Script 1.1
ATN Jobs Software 4.0
ATN Mall 2.0
WeBuilder 2015 13.3
Related Code
Hex To Binary Array
Binary Array Search
Random Binary Array
Binary Search Tree In Array Java Code
Binary Searching In Array Pascal
Binary Search Two Dimensional Array
Binary Search Tree Array
Binary Search Tree In Array Java Code
Binary Search Using Array
Binary Search Tree Array Based Implementation
Binary Search Tree Array Based Implementation C
Binary Search In Classified Two Dimension Array
Array Binary File
Array Based Binary Search Tree
Java Binary Tree Using An Array
Binary Array
All | Freeware

Code 1-20 of 100   Pages: Go to  1  2  3  4  5  Next >>  page  






findMIS is an heuristic algorithm for solving Maximum Independent Set problem (MIS).
An independent set of a graph is a subset of vertices in which no two vertices are
adjacent. Given a set of vertices, the maximum independent set problem calls
for finding the independent set of maximum cardinality.

Algorithm run in O(n^2) time, where n is the number of vertices (worst case).
Experimentally: time = 8.1e-007*n^2 +...



isParetoSetMember returns the logical Pareto membership of a set of N points in K dimensions. It takes as input a N-by-N matrix and return a N-binary-array, denoting for each of the N points, whether it is Pareto (1) o not (0).

The...



DSA extensions contains classes similar in purpose to the classes provided in java.util.

Currently, it contains sortable Lists and Maps, as well as a balanced binary search tree and a binary array search algorithm.



FISHERTEST - Fisher Exact test for 2-x-2 contingency tables

H = FISHERTEST(M) performs the non-parametric Fisher exact probability
test on a 2-by-2 contingency table described by M, and returns the
result in H. It...



This code converts a Galois Field array created using GF(2^m) for a given primitive polynomial into the 'exponential' notation, which you can use with gfrepcov() to binary if you wish.

Uses the gf2dec() function internally.



Packable: a ruby library that goes way beyond the builtin Array::pack and String::unpack to make packing and unpacking of binary data easy and powerful.



Efficiently Searching a Sorted Array is an useful tutorial in which author discusses about the method of sorting the arrays for searching a particular element in the array with the help of binary search algorithum. This tutorial programmers can...



JMatIO is a JAVA library to read/write/manipulate with Matlab's binary MAT-files.

Currently supported data types are:
+ Double array
+ UInt8, Int8 array
+ UInt64, Int64 array
+ Char array
+ Structure
+ Cell...



LABEL is a generalization of BWLABEL: BWLABEL works with 2-D binary images only, whereas LABEL works with 2-D arrays of any class.

L = LABEL(I,N) returns a matrix L, of the same size as I, containing labels for the connected components...



a = enumBase2(n) constructs a cell array that enumerates from 0 to (2^n - 1) in binary.

a = enumBase2(n,outputformat) constructs an array that enumerates from 0
to (2^n - 1) in binary. The type of array output is given by
...



multiFind serves a similar purpose as find but when looking for multiple elements in an array of numbers. It returns two arrays of numbers. Each row of the two arrays contains the pair of indexes in which the numbers were found in the two...



These programs were developed for fast conversions between binary and decimal integers (there are other programs by fellow Matlab-users, dealing with fractions). They can be useful when the binary numbers are in vector form instead of strings.



bin2header takes any file as an argument and converts its binary data into a source header file for use in C/C++ applications. The data is stored as a character array.



bin2hex is Unix compatible. Converts binary files into a Perl, Pascal/Delphi, C/C++, or Java source code array.



Flatten a nested array/tuple



One way to read files that contain binary fields is to use the struct module. However, to do this properly one must learn struct's format characters, which may look especially cryptic when sprinkled around the code. So instead, I use a wrapper...



Really short snipped of a decimal and binary prefix calculator in Python.

Without covering the entire International System of Units (SI) range, it does fit my daily needs.
The code could be way smarter, but i wanted to keep the...



This is a very simple look-up based method for converting integer to binary string. In my tests, using 'timeit', its the fastest around. And with increasing value of input decimal number, it surpases any 'run time computation' based method doing...



Being a MySQL DBA , one faces a common issue in replication environment -> Disk space issue on master, since the number of binary logs have increased.
Now, one of the solution to this would be using expire_logs_days parameter in your mysql...



Routines for converting large unsigned arbitrary sized Python integers to packed binary data strings and vice versa.