Sciweavers

588 search results - page 4 / 118
» A Fast Distributed Algorithm for Approximating the Maximum M...
Sort
View
FOCS
2008
IEEE
14 years 1 months ago
Constant-Time Approximation Algorithms via Local Improvements
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
Huy N. Nguyen, Krzysztof Onak
ISPAN
1997
IEEE
13 years 11 months ago
RMESH Algorithms for Parallel String Matching
Abstract- String matching problem received much attention over the years due to its importance in various applications such as text/file comparison, DNA sequencing, search engines,...
Hsi-Chieh Lee, Fikret Erçal
TIP
2008
169views more  TIP 2008»
13 years 7 months ago
Maximum Likelihood Wavelet Density Estimation With Applications to Image and Shape Matching
Density estimation for observational data plays an integral role in a broad spectrum of applications, e.g. statistical data analysis and information-theoretic image registration. ...
Adrian M. Peter, Anand Rangarajan
IPL
2006
151views more  IPL 2006»
13 years 7 months ago
Approximating weighted matchings in parallel
We present an NC approximation algorithm for the weighted matching problem in graphs with an approximation ratio of (1 - ). This improves the previously best approximation ratio of...
Stefan Hougardy, Doratha E. Drake Vinkemeier