250 search results - page 7 / 50 » A Parallel Iterative Improvement Stable Matching Algorithm |
ESWS
2006
Springer
15 years 1 months ago
2006
Springer
We present a new iterative algorithm for ontology mapping where we combine standard string distance metrics with a structural similarity measure that is based on a vector represent...
CCGRID
2007
IEEE
15 years 1 months ago
2007
IEEE
We describe a hybrid linear programming (LP) and evolutionary algorithm (EA) based resource matcher suitable for heterogeneous grid environments. The hybrid matcher adopts the ite...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
The two major approaches to sparse recovery are L1-minimization and greedy methods. Recently, Needell and Vershynin developed Regularized Orthogonal Matching Pursuit (ROMP) that ha...
58
Voted
MOC
2000
14 years 9 months ago
2000
The best algorithm known for finding logarithms on an elliptic curve (E) is the (parallelized) Pollard lambda collision search. We show how to apply a Pollard lambda search on a se...
89
Voted
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
Recent works in modified compressed sensing (CS) show that reconstruction of sparse or compressible signals with partially known support yields better results than traditional CS...