86 search results - page 17 / 18 » Worst-Case Running Times for Average-Case Algorithms |
CORR
2010
Springer
13 years 6 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...
JACM
2000
13 years 5 months ago
2000
We consider comparator networks M that are used repeatedly: while the output produced by M is not sorted, it is fed again into M. Sorting algorithms working in this way are called ...
WINET
2002
13 years 5 months ago
2002
Wireless ad-hoc sensor networks have the potential to provide the missing interface between the physical world and the Internet, thus impacting a large number of users. This conne...
MOC
2010
13 years 22 days ago
2010
We define the weight of an integer N to be the smallest w such that N can be represented as w i=1 i2ci , with 1,..., w{1,-1}. Since arithmetic modulo a prime of low weight is parti...
CODES
2007
IEEE
14 years 9 days ago
2007
IEEE
Caches are notorious for their unpredictability. It is difficult or even impossible to predict if a memory access results in a definite cache hit or miss. This unpredictability i...