An Improved Affine Equivalence Algorithm for Random PermutationsIn this paper we study the affine equivalence problem, where given two functions [equation], the goal is to determine whether there exist invertible affine transformations [equation] over [equation]...doi:10.1007/978-3-319-78381-9_16Itai DinurSpringer, Cham
Zhao, c, Peng, Q., Liu, C.: An improved structural equivalence weighted similarity for recommender systems. Proc. Eng. 15, 1869–1873 (2011) Article Google Scholar Li, K., Lan, D.: A collaborative filtering hybrid recommendation algorithm for attribute and rating. Comput. Technol. Dev. ...
This paperis organized as follows: in Section 2 we describe ourimproved algorithm forapproximating(1.1). In Section 3,we propose a method to compute the integral (3.1)based on the quadrature rule presented in Section 2. In Section 4,we give the convergence rates onω.The validity of these ...
This algorithm has been improved further by Agarwal et al. See also Boissonnat et al. [4]. Aurenhammer and Schwarzkopf [3] give a simple randomized incremental algorithm for computing kth order Voronoi diagram in the plane with O(nk2 log n + nk log3 n) expected running time and optimal...
In the first step attributes are ordered according to some criterion (e.g., alphabetically); this eases checking for set equivalence. The algorithm then generates all i-tuples of conditions with sufficiently high support. These i-tuples (also called frequent itemsets) are subsequently used to ...
and symmetric groups. A polynomial-time quantum algorithm for the former case would give an efficient algorithm for finding shortest vectors in lattices;17an efficient quantum algorithm for the latter case would give an efficient test for isomorphism of graphs (equivalence under relabelling of ...
Originally formulated for the comparison of multiple imaging modalities, this analysis has been adapted to the setting in which the population of radiologists operate on a single modality and interest lies in comparing their performance to that of a stand-alone algorithm61. The jackknife method was ...
Since few years, the gastroenterologic examinations could have been realised by wireless video capsules. Although the images make it possible to analyse some diseases, the diagnosis could be improved by the use of the 3D Imaging techniques implemented in
The Marching Cubes Algorithm is a simple computer graphics algorithm that is data-intensive and used to create a three-dimensional surface mesh from a set of data points. AI generated definition based on: Accelerating MATLAB with GPU Computing, 2014 ...
Performance of the basic partition refinement algorithm can be significantly improved through the use of more complex data structures. Paige and Tarjan [24] proposed an algorithm that utilizes information about previous splits to make future splits more efficient. To simplify the presentation of the ...