Against all Odds: The amazing but most true story of Aviezri Fraenkel and his special favorite: The responsa project or the multi-faceted contributions of Aviezri Fraenkel to information retrieval and the related areas.
AI clustering techniques: a new approach in horizontal fragmentation of classes with complex attributes and methods in object oriented databases.
Algebraic definition of a functional programming language and its semantic models
Algorithme de décomposition de clés
An algebraic approach to fix points of GOST-algorithm
An algorithm to compute the möbius function of the rotation lattice of binary trees
An analysis of selection sort using recurrence relations.
This paper presents a method for obtaining the expected number of data movements executed by the well-known Selection sort algorithm along with its corresponding variance. The approach presented here requires hardly any specific mathematical background. In particular, the average-case cost and variance are represented using recurrence relations whose solutions lead to the desired results. Even though this method is not applicable in general, it serves to conveniently present average-case algorithm...
An angent based approach to modeling the secure electronic transaction protocol.
An application of algebraic geometry to encryption: tame transformation method.
An application of -ary trees to the design of data structures for geometric searching problems
An axiomatic theory of information trees
An Efficient Procedure for Mining Statistically Significant Frequent Itemsets
An efficient SQL-based querying method to RDF schemata
An optimized soft computing-based passage retrieval system
Analysis of Algorithms: An Example of a Sort Algorithm
We analyse three algorithms: exponentiation by squaring, calculation of maximum, and sorting by exchanging in terms of program algebra over an algebra.
Analysis of quickselect : an algorithm for order statistics
Application of the Constrained Edit Distance Algorithm to Search Procedures
Applying A Normalized Compression Metric To The Measurement Of Dialect Distance
The paper discusses the application of a similarity metric based on compression to the measurement of the distance among Bulgarian dia- lects. The similarity metric is de ned on the basis of the notion of Kolmo- gorov complexity of a le (or binary string). The application of Kolmogorov complexity in practice is not possible because its calculation over a le is an undecidable problem. Thus, the actual similarity metric is based on a real life compressor which only approximates the Kolmogorov complexity....
Arbitrary weight changes in dynamic trees
Associative models for storing and retrieving concept lattices.