Sciweavers

8697 search results - page 84 / 1740
» Measures of Distributional Similarity
Sort
View
SSDBM
2010
IEEE
220views Database» more  SSDBM 2010»
15 years 2 months ago
Prefix Tree Indexing for Similarity Search and Similarity Joins on Genomic Data
Similarity search and similarity join on strings are important for applications such as duplicate detection, error detection, data cleansing, or comparison of biological sequences....
Astrid Rheinländer, Martin Knobloch, Nicky Ho...
HPDC
2008
IEEE
15 years 4 months ago
StoreGPU: exploiting graphics processing units to accelerate distributed storage systems
Today Graphics Processing Units (GPUs) are a largely underexploited resource on existing desktops and a possible costeffective enhancement to high-performance systems. To date, mo...
Samer Al-Kiswany, Abdullah Gharaibeh, Elizeu Santo...
MICCAI
2006
Springer
15 years 10 months ago
Multi-modal Image Registration Using the Generalized Survival Exponential Entropy
Abstract. This paper introduces a new similarity measure for multimodal image registration task. The measure is based on the generalized survival exponential entropy (GSEE) and mut...
Shu Liao, Albert C. S. Chung
MICCAI
2004
Springer
15 years 3 months ago
Registration Using Segment Intensity Remapping and Mutual Information
A method for processing images prior to normalized mutual information based registration and an enhancement of the registration measure are presented. The method relies on k-means ...
Zeger F. Knops, J. B. Antoine Maintz, Max A. Vierg...
COCO
1995
Springer
134views Algorithms» more  COCO 1995»
15 years 1 months ago
Towards Average-Case Complexity Analysis of NP Optimization Problems
For the worst-case complexity measure, if P = NP, then P = OptP, i.e., all NP optimization problems are polynomial-time solvable. On the other hand, it is not clear whether a simi...
Rainer Schuler, Osamu Watanabe