2485 search results - page 127 / 497 » Time Bounded Frequency Computations |
134
Voted
SPAA
2010
ACM
15 years 9 months ago
2010
ACM
In dynamically multithreaded platforms that employ work stealing, there appears to be a fundamental tradeoff between providing provably good time and space bounds and supporting S...
164
Voted
CORR
2010
Springer
15 years 5 months ago
2010
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...
160
Voted
COLT
1993
Springer
15 years 9 months ago
1993
Springer
In this paper we demonstrate how weighted majority voting with multiplicative weight updating can be applied to obtain robust algorithms for learning binary relations. We first pre...
139
click to vote
IM
2007
15 years 4 months ago
2007
In this paper we suggest evaluating the importance of a website with the mean frequency of visiting the website for the Markov chain on the Internet Graph describing random surfi...
159
click to vote
CGF
2004
15 years 4 months ago
2004
We present an algorithm for fast computation of discretized 3D distance fields using graphics hardware. Given a set of primitives and a distance metric, our algorithm computes the...