Sciweavers

144 search results - page 24 / 29
» Landmark matching on the sphere using distance functions
Sort
View
SODA
1998
ACM
113views Algorithms» more  SODA 1998»
13 years 8 months ago
Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
David Eppstein
BMCBI
2008
130views more  BMCBI 2008»
13 years 7 months ago
A database of phylogenetically atypical genes in archaeal and bacterial genomes, identified using the DarkHorse algorithm
Background: The process of horizontal gene transfer (HGT) is believed to be widespread in Bacteria and Archaea, but little comparative data is available addressing its occurrence ...
Sheila Podell, Terry Gaasterland, Eric E. Allen
DGCI
2003
Springer
14 years 21 days ago
Geodesic Object Representation and Recognition
This paper describes a shape signature that captures the intrinsic geometric structure of 3D objects. The primary motivation of the proposed approach is to encode a 3D shape into a...
A. Ben Hamza, Hamid Krim
ICPR
2010
IEEE
13 years 11 months ago
Multiple Atlas Inference and Population Analysis with Spectral Clustering
In medical imaging, constructing an atlas and bringing an image set in a single common reference frame may easily lead the analysis to erroneous conclusions, especially when the po...
Giorgos Sfikas, Christian Heinrich, Christophoros ...
MMAS
2010
Springer
13 years 2 months ago
Source Localization in Random Acoustic Waveguides
Mode coupling due to scattering by weak random inhomogeneities in waveguides leads to loss of coherence of wave fields at long distances of propagation. This in turn leads to serio...
Liliana Borcea, Leila Issa, Chrysoula Tsogka