-
-
binary_archivator.rar
This is a binary compress program. It is able to add files into arhiva.txt and also to delete files from arhiva.txt. It saves files to arhiva.txt under this format: name space content
-
AlgoritmRabina_Karpa.rar
... m, its average and best case running time is O(n+m) in space O(p), but its worst-case time is O(nm). In ... string matching algorithm has asymptotic worst-time complexity O(n+m) in space O(m).
A practical application of Rabin–Karp is detecting plagiarism. ...
-
Simplex_.rar
Simplex algorithm - an optimization algorithm for solving linear programming problems by searching the vertices of a convex polyhedron in multidimensional space.
-
protocol-anomaly-detection-network-based-intrusio
A taxonomy was developed by Axelsson to define the space of intrusion detection technology and classify IDSs.
The taxonomy categorizes IDSs by their detection principle and their operational aspects. The two main
categories of detection principles are ...
-
acm-mm04-p276-yang.rar
In this paper we propose a novel space-time color feature representation for video shot and apply it to content identification.
In this representation the shot is cut into k equal size segments, and each segment is represented by a blending image formed ...
-
MIMO.rar
...
is so large that it was beyond our aim to cover all aspects in details. Rather, our goal has
been to provide researchers, R&D engineers and graduate students with a comprehensive
coverage of radio propagation models and space杢ime coding techniques.
-
simAnealing.zip
... approximation to the global optimum of a given function in a large search space. It is often used when the search space is discrete (e.g., all tours that visit a given set of cities). For certain problems, simulated annealing may be ...
-
svpwm_matlab.zip
Space Vector PWM (SVPWM) is a more sophisticated technique for generating a fundamental sine wave that provides a higher voltage to the motor
-
-
KD_Tree.zip
... , a kd-tree (short for k-dimensional tree) is a space-partitioning data structure for organizing points in a k-dimensional space. kd-trees are a useful data structure for several applications, such as searches involving a multidimensional ...
-