Sciweavers

7758 search results - page 56 / 1552
» On the Number of Distributive Lattices
Sort
View
PAMI
1998
96views more  PAMI 1998»
13 years 8 months ago
On the Accuracy of Zernike Moments for Image Analysis
—In this paper, we give a detailed analysis of the accuracy of Zernike moments in terms of their discretization errors and the reconstruction power. It is found that there is an ...
Simon X. Liao, Miroslaw Pawlak
PDCAT
2007
Springer
14 years 2 months ago
High Throughput Multi-port MT19937 Uniform Random Number Generator
ct There have been many previous attempts to accelerate MT19937 using FPGAs but we believe that we can substantially improve the previous implementations to develop a higher throug...
Vinay Sriram, David Kearney
IPPS
2005
IEEE
14 years 2 months ago
PDM Sorting Algorithms That Take A Small Number of Passes
We live in an era of data explosion that necessitates the discovery of novel out-of-core techniques. The I/O bottleneck has to be dealt with in developing out-of-core methods. The...
Sanguthevar Rajasekaran, Sandeep Sen
IJBRA
2007
89views more  IJBRA 2007»
13 years 8 months ago
Conservative adjustment of permutation p-values when the number of permutations is limited
The permutation procedure is widely used to assess the significance level (p-value) of a test statistic. This approach is asymptotically consistent. In genomics and proteomics st...
Yinglei Lai
EJC
2006
13 years 8 months ago
Poset edge-labellings and left modularity
It is known that a graded lattice of rank n is supersolvable if and only if it has an EL-labelling where the labels along any maximal chain are exactly the numbers 1, 2, . . . , n ...
Peter McNamara, Hugh Thomas