Sciweavers

1261 search results - page 36 / 253
» Approximation algorithms for aligning points
Sort
View
SIAMJO
2008
76views more  SIAMJO 2008»
14 years 9 months ago
Identification and Elimination of Interior Points for the Minimum Enclosing Ball Problem
Given A := {a1, . . . , am} Rn, we consider the problem of reducing the input set for the computation of the minimum enclosing ball of A. In this note, given an approximate soluti...
S. Damla Ahipasaoglu, E. Alper Yildirim
75
Voted
NIPS
2007
14 years 11 months ago
Measuring Neural Synchrony by Message Passing
A novel approach to measure the interdependence of two time series is proposed, referred to as “stochastic event synchrony” (SES); it quantifies the alignment of two point pr...
Justin Dauwels, François B. Vialatte, Tomas...
INFORMATICALT
2008
139views more  INFORMATICALT 2008»
14 years 9 months ago
Fingerprint Minutiae Matching without Global Alignment Using Local Structures
This paper presents a method of minutiae based fingerprint matching that is robust to deformations and does not do fingerprint alignment. It concentrates on comparing rotation and ...
Andrej Kisel, Alexej Kochetkov, Justas Kranauskas
96
Voted
SODA
1992
ACM
179views Algorithms» more  SODA 1992»
14 years 10 months ago
Approximating the Minimum Weight Triangulation
We show that the length of the minimum weight Steiner triangulation (MWST) of a point set can be approximated within a constant factor by a triangulation algorithm based on quadtr...
David Eppstein
BMCBI
2005
115views more  BMCBI 2005»
14 years 9 months ago
Statistical distributions of optimal global alignment scores of random protein sequences
Background: The inference of homology from statistically significant sequence similarity is a central issue in sequence alignments. So far the statistical distribution function un...
Hongxia Pang, Jiaowei Tang, Su-Shing Chen, Shiheng...