Sciweavers

1051 search results - page 46 / 211
» On the Correspondence between Approximations and Similarity
Sort
View
CPM
2009
Springer
121views Combinatorics» more  CPM 2009»
16 years 22 days ago
LCS Approximation via Embedding into Local Non-repetitive Strings
A classical measure of similarity between strings is the length of the longest common subsequence(LCS) between the two given strings. The search for efficient algorithms for findi...
Gad M. Landau, Avivit Levy, Ilan Newman
SCVMA
2004
Springer
15 years 11 months ago
Segregation of Moving Objects Using Elastic Matching
We present a method for figure-ground segregation of moving objects from monocular video sequences. The approach is based on tracking extracted contour fragments, in contrast to ...
Vishal Jain, Benjamin B. Kimia, Joseph L. Mundy
WIRN
2005
Springer
15 years 11 months ago
Ensembles Based on Random Projections to Improve the Accuracy of Clustering Algorithms
We present an algorithmic scheme for unsupervised cluster ensembles, based on randomized projections between metric spaces, by which a substantial dimensionality reduction is obtai...
Alberto Bertoni, Giorgio Valentini
HYBRID
2003
Springer
15 years 11 months ago
Reachability Analysis of Nonlinear Systems Using Conservative Approximation
Abstract. In this paper we present an approach to approximate reachability computation for nonlinear continuous systems. Rather than studying a complex nonlinear system ˙x = g(x),...
Eugene Asarin, Thao Dang, Antoine Girard
IACR
2011
141views more  IACR 2011»
14 years 5 months ago
Approximate common divisors via lattices
We analyze the multivariate generalization of Howgrave-Graham’s algorithm for the approximate common divisor problem. In the m-variable case with modulus N and approximate common...
Henry Cohn, Nadia Heninger