We present two new k-dimensional data structures, called the PKD-tree and the PKD-tree, respectively. They are explored for indexing combined text and point data, and evaluated experimentally for orthogonal range search (for 2 ≤ k ≤ 100 and n up to 1,000,000) using synthetic data and real data. We compared the range search performance of the PKD-tree with the PKD-tree, the k-d tree, the Pyramid...

introduction the debate regarding the description on classification and nomenclature of the injury which includes olecranon fracture associated with radial neck fractures in children is ongoing. we report two pediatric cases that could not be classified in a monteggia-equivalents system and were treated with open reduction and k-wire fixation. the aim of this study was to perform a systematic r...

‎three infinite families of finite abelian groups will be‎ ‎described such that each member of these families has‎ ‎the r'edei $k$-property for many non-trivial values of $k$‎.

The envelope, EðAÞ, of a complex square matrix A is a region in the complex plane that contains the spectrum of A and is contained in the numerical range of A. The envelope is compact but not necessarily convex or connected. The connected components of EðAÞ have the potential of isolating the eigenvalues of A, leading us to study its geometry, boundary, and number of components. We also examine...