7006 search results - page 188 / 1402 » Approximation Algorithms |
130
click to vote
IM
2007
15 years 3 months ago
2007
Abstract. In this paper, we consider the problem of calculating fast and accurate approximations to the personalized PageRank score of a webpage. We focus on techniques to improve ...
135
click to vote
ALGORITHMICA
2005
15 years 3 months ago
2005
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
SODA
1994
ACM
15 years 4 months ago
1994
ACM
Abstract Yossi Matias Je rey Scott Vitter y Neal E. Young z In this paper we introduce the notion of approximate data structures, in which a small amount of error is tolerated in...
101
click to vote
FCT
2003
Springer
15 years 8 months ago
2003
Springer
The closest substring problem, where a short string is sought that minimizes the number of mismatches between it and each of a given set of strings, is a minimization problem with ...
135
click to vote
ICASSP
2008
IEEE
15 years 9 months ago
2008
IEEE
In this paper we propose novel algorithms for image restoration and parameter estimation with a Generalized Gaussian Markov Random Field prior utilizing variational distribution a...