7150 search results - page 100 / 1430 » An Approximation Algorithm for Approximation Rank |
115
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
A major enterprise in compressed sensing and sparse approximation is the design and analysis of computationally tractable algorithms for recovering sparse, exact or approximate, s...
128
Voted
WWW
2008
ACM
16 years 3 months ago
2008
ACM
Motivated by several marketplace applications on rapidly growing online social networks, we study the problem of efficient offline matching algorithms for online exchange markets....
99
Voted
CEC
2007
IEEE
15 years 8 months ago
2007
IEEE
Abstract—Hybrid methods are very popular for solving problems from combinatorial optimization. In contrast to this the theoretical understanding of the interplay of different opt...
100
click to vote
DSD
2010
IEEE
15 years 2 months ago
2010
IEEE
—This paper presents an approximate Maximum Common Subgraph (MCS) algorithm, specifically for directed, cyclic graphs representing digital circuits. Because of the application d...
123
Voted
PR
1998
15 years 2 months ago
1998
This paper describes a method for optimizing the cost matrix of any approximate string matching algorithm based on the Levenshtein distance. The method, which uses genetic algorit...