Sciweavers

1809 search results - page 151 / 362
» Weakly Computable Real Numbers
Sort
View
CLUSTER
2008
IEEE
15 years 11 months ago
Are nonblocking networks really needed for high-end-computing workloads?
—High-speed interconnects are frequently used to provide scalable communication on increasingly large high-end computing systems. Often, these networks are nonblocking, where the...
Narayan Desai, Pavan Balaji, P. Sadayappan, Mohamm...
GD
2000
Springer
15 years 8 months ago
User Preference of Graph Layout Aesthetics: A UML Study
The merit of automatic graph layout algorithms is typically judged on their computational efficiency and the extent to which they conform to aesthetic criteria (for example, minimi...
Helen C. Purchase, Jo-Anne Allder, David A. Carrin...
RECOMB
2006
Springer
16 years 4 months ago
Algorithms to Distinguish the Role of Gene-Conversion from Single-Crossover Recombination in the Derivation of SNP Sequences in
Meiotic recombination is a fundamental biological event and one of the principal evolutionary forces responsible for shaping genetic variation within species. In addition to its fu...
Yun S. Song, Zhihong Ding, Dan Gusfield, Charles H...
ECCV
2008
Springer
16 years 6 months ago
What Is a Good Nearest Neighbors Algorithm for Finding Similar Patches in Images?
Many computer vision algorithms require searching a set of images for similar patches, which is a very expensive operation. In this work, we compare and evaluate a number of neares...
Neeraj Kumar, Li Zhang, Shree K. Nayar
ICIP
2000
IEEE
16 years 6 months ago
A Fast Hierarchical Algorithm of Maximum Intensity Projection
The maximum intensity projection (MIP) is a useful tool to visualize 3D images. The processing time of the MIP depends on the number of voxels of the 3D data. Therefore, it is ver...
Keun Ho Kim, Min Jeong Kwon, Hyun Wook Park