8431 search results - page 388 / 1687 » Algorithmically Independent Sequences |
190
Voted
CPM
2005
Springer
16 years 11 days ago
2005
Springer
Abstract. The Knuth-Morris-Pratt (KMP) pattern-matching algorithm guarantees both independence from alphabet size and worst-case execution time linear in the pattern length; on the...
160
click to vote
IPPS
1993
IEEE
15 years 11 months ago
1993
IEEE
Abstract. Development of wormhole routing techniques so far has been largely independent of the results available for store-and-forward routing in literature. In this paper, we pro...
185
click to vote
TIT
2010
15 years 1 months ago
2010
Belief propagation is shown to be an instance of a hybrid between two projection algorithms in the convex programming literature: Dykstra's algorithm with cyclic Bregman proje...
205
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
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...
199
click to vote
SAC
2006
ACM
16 years 24 days ago
2006
ACM
This paper explores the generation of candidates, which is an important step in frequent itemset mining algorithms, from a theoretical point of view. Important notions in our prob...