Data base applications in Visual Foxpro.
Data mining techniques using decision tree model in materialised projection and selection view.
With the availability of very large data storage today, redundant data structures are no longer a big issue. However, an intelligent way of managing materialised projection and selection views that can lead to fast access of data is the central issue dealt with in this paper. A set of implementation steps for the data warehouse administrators or decision makers to improve the response time of queries is also defined. The study concludes that both attributes and tuples, are important factors to be...
Data types as algorithms
Decision support based methods to facilitate 3D volumetric locking in a new peer to peer based spatial database system
Design and implementation of the query language interpreter for bibliographic data retrieval.
Detecting the morphic images of a word : improving the general algorithm
Deux constructions équivalentes d'un jeu d'arrangements pour les fichiers inverses multi-indices
Deux problèmes d'analyse d'algorithmes
Discovery of functional and approximate functional dependencies in relational databases.
Domination Game: Extremal Families for the 3/5-Conjecture for Forests
In the domination game on a graph G, the players Dominator and Staller alternately select vertices of G. Each vertex chosen must strictly increase the number of vertices dominated. This process eventually produces a dominating set of G; Dominator aims to minimize the size of this set, while Staller aims to maximize it. The size of the dominating set produced under optimal play is the game domination number of G, denoted by γg(G). Kinnersley, West and Zamani [SIAM J. Discrete Math. 27 (2013) 2090-2107]...
Dynamic Point Location in Arrangements of Hyperplanes.
Dynamic programming for reduced NFAs for approximate string and sequence matching
searching for all occurrences of a pattern (string or sequence) in some text, where the pattern can occur with some limited number of errors given by edit distance. Several methods were designed for the approximate string matching that simulate nondeterministic finite automata (NFA) constructed for this problem. This paper presents reduced NFAs for the approximate string matching usable in case, when we are interested only in occurrences having edit distance less than or equal to a given integer,...